FRINK Linked Data Fragments server

Matches in SemOpenAlex for { <https://semopenalex.org/work/W2789218008> ?p ?o ?g. }

• W2789218008 abstract "Abstract Given a graph G = ( V , E ) , not necessarily finite, a graphoidal cover of G means a collection Ψ of non-trivial paths in G called Ψ -edges, which are not necessarily open (not necessarily finite), such that every vertex of G is an internal vertex of at most one path in Ψ and every edge of G is in exactly one path in Ψ . The set of all graphoidal covers of a graph G = ( V , E ) is denoted by G G and for a given Ψ ∈ G G the ordered pair ( G , Ψ ) is called a graphoidally covered graph. Two vertices u and v of G are Ψ -adjacent if they are the ends of an open Ψ -edge. A set D of vertices in ( G , Ψ ) is Ψ -independent if no two vertices in D are Ψ -adjacent and is said to be Ψ -dominating if every vertex of G is either in D or is Ψ -adjacent to a vertex in D ; G is γ Ψ ( G ) -definable ( γ i Ψ ( G ) -definable) if ( G , Ψ ) has a finite Ψ -dominating ( Ψ -independent Ψ -dominating) set. Clearly, if G is γ i Ψ ( G ) -definable, then G is γ Ψ ( G ) -definable and γ Ψ ( G ) ≤ γ i Ψ ( G ) . Further if for any graphoidal cover Ψ of G such that γ Ψ ( G ) = γ i Ψ ( G ) then we call Ψ as a least-kernel graphoidal cover of G (in short, an LKG cover of G ). A graph is said to be a least kernel graphoidal graph or simply an LKG graph if it possesses an LKG cover. This paper is based on a conjecture by Dr. B.D Acharya, “Every graph possesses an LKG cover”. After finding an example of a graph which does not possess an LKG cover, we obtain a necessary condition in the form of forbidden subgraph for a graph to be a least kernel graphoidal graph. We further prove that the condition is sufficient for a block graph with a unique nontrivial block. Thereafter we identify certain classes of graphs in which every graph possesses an LKG cover. Moreover, following our surmise that every graph with Δ ≤ 6 possesses an LKG cover, we were able to show that every finite graph with Δ ≤ 3 is indeed an LKG graph." @default.
• W2789218008 created "2018-03-06" @default.
• W2789218008 creator A5008708299 @default.
• W2789218008 creator A5024994848 @default.
• W2789218008 date "2018-04-01" @default.
• W2789218008 modified "2023-09-28" @default.
• W2789218008 title "Domination in graphoidally covered graphs: Least-kernel graphoidal graphs-II" @default.
• W2789218008 cites W1975119263 @default.
• W2789218008 cites W1988932681 @default.
• W2789218008 cites W1995459638 @default.
• W2789218008 cites W2021962931 @default.
• W2789218008 cites W2028032378 @default.
• W2789218008 cites W2047960318 @default.
• W2789218008 cites W2209991604 @default.
• W2789218008 cites W2509140350 @default.
• W2789218008 doi "https://doi.org/10.1016/j.akcej.2018.01.002" @default.
• W2789218008 hasPublicationYear "2018" @default.
• W2789218008 type Work @default.
• W2789218008 sameAs 2789218008 @default.
• W2789218008 citedByCount "0" @default.
• W2789218008 crossrefType "journal-article" @default.
• W2789218008 hasAuthorship W2789218008A5008708299 @default.
• W2789218008 hasAuthorship W2789218008A5024994848 @default.
• W2789218008 hasBestOaLocation W27892180081 @default.
• W2789218008 hasConcept C114614502 @default.
• W2789218008 hasConcept C118615104 @default.
• W2789218008 hasConcept C121134508 @default.
• W2789218008 hasConcept C132525143 @default.
• W2789218008 hasConcept C149530733 @default.
• W2789218008 hasConcept C203776342 @default.
• W2789218008 hasConcept C2780990831 @default.
• W2789218008 hasConcept C33923547 @default.
• W2789218008 hasConcept C80899671 @default.
• W2789218008 hasConceptScore W2789218008C114614502 @default.
• W2789218008 hasConceptScore W2789218008C118615104 @default.
• W2789218008 hasConceptScore W2789218008C121134508 @default.
• W2789218008 hasConceptScore W2789218008C132525143 @default.
• W2789218008 hasConceptScore W2789218008C149530733 @default.
• W2789218008 hasConceptScore W2789218008C203776342 @default.
• W2789218008 hasConceptScore W2789218008C2780990831 @default.
• W2789218008 hasConceptScore W2789218008C33923547 @default.
• W2789218008 hasConceptScore W2789218008C80899671 @default.
• W2789218008 hasLocation W27892180081 @default.
• W2789218008 hasOpenAccess W2789218008 @default.
• W2789218008 hasPrimaryLocation W27892180081 @default.
• W2789218008 hasRelatedWork W1973079746 @default.
• W2789218008 hasRelatedWork W1976741135 @default.
• W2789218008 hasRelatedWork W2047960318 @default.
• W2789218008 hasRelatedWork W2066125721 @default.
• W2789218008 hasRelatedWork W2128241782 @default.
• W2789218008 hasRelatedWork W2140273161 @default.
• W2789218008 hasRelatedWork W2181572306 @default.
• W2789218008 hasRelatedWork W2251473351 @default.
• W2789218008 hasRelatedWork W2320461682 @default.
• W2789218008 hasRelatedWork W2329790050 @default.
• W2789218008 hasRelatedWork W2332076149 @default.
• W2789218008 hasRelatedWork W2555368726 @default.
• W2789218008 hasRelatedWork W2742680891 @default.
• W2789218008 hasRelatedWork W2746667039 @default.
• W2789218008 hasRelatedWork W2950168417 @default.
• W2789218008 hasRelatedWork W2962946956 @default.
• W2789218008 hasRelatedWork W2969695232 @default.
• W2789218008 hasRelatedWork W2978226454 @default.
• W2789218008 hasRelatedWork W3040329153 @default.
• W2789218008 hasRelatedWork W1531383880 @default.
• W2789218008 isParatext "false" @default.
• W2789218008 isRetracted "false" @default.
• W2789218008 magId "2789218008" @default.
• W2789218008 workType "article" @default.