Results 1 to 10 of about 53 (42)
Domination in graphoidally covered graphs: Least-kernel graphoidal graphs-II
AKCE International Journal of Graphs and Combinatorics, 2018 Given a graph , not necessarily finite, a graphoidal cover of means a collection of non-trivial paths in called -edges, which are not necessarily open (not necessarily finite), such that every vertex of is an internal vertex of at most one path in and every edge of G is in exactly one path in .
Rajesh Singh, Purnima Gupta
exaly +4 more sources
Domination in graphoidal covers of a graph
Discrete Mathematics, 1999 The concept of graphoidal cover was introduced by B. D. Acharya and E. Sampathkumar. A graphoidal cover of a graph \(G\) is a family \(\psi\) of paths in \(G\) (not necessarily open) such that each edge of \(G\) belongs to exactly one path from \(\psi\). The paper develops the theory of \(\psi\)-independence and \(\psi\)-domination. Two vertices of \(G\
Purnima Gupta
exaly +3 more sources
Domination in Graphoidally Covered Graphs: Least-Kernel Graphoidal Covers
Electronic Notes in Discrete Mathematics, 2016 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 Ψ.
Purnima Gupta
exaly +2 more sources
Acyclic graphoidal covers and path partitions in a graph
Discrete Mathematics, 1998 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Subramanian Arumugam
exaly +3 more sources
On 2−simple graphoidal cover of a graph [PDF]
AIP Conference Proceedings, 2020 Venkat Narayanan Gangatharan +2 more
exaly +2 more sources
THE MONOPHONIC GRAPHOIDAL COVERING NUMBER OF A GRAPH [PDF]
International Journal of Pure and Apllied Mathematics, 2014 A chord of a path P is an edge joining two non-adjacent vertices of P. A path P is called a monophonic path if it is a chordless path. A monophonic graphoidal cover of a graph G is a collection m of monophonic paths in G such that every vertex of G is an internal vertex of at most one monophonic path in m and every edge of G is in exactly one ...
P. Titus, S.S. Kumari
openaire +1 more source
Monophonic graphoidal covering number of corona product graphs
Proyecciones (Antofagasta), 2023 In a graph G, a chordless path is called a monophonic path. A collection ψm of monophonic paths in G is called a monophonic graphoidal cover of G if every vertex of G is an internal vertex of at most one monophonic path in ψm and every edge of G is in exactly one monophonic path in ψm. The monophonic graphoidal covering number ηm(G) of G is the minimum
Titus, P., Subha, M., Kumari, S. Santha
openaire +1 more source
Equality of graphoidal and acyclic graphoidal covering number of a graph
Tamkang Journal of Mathematics, 2006 A {\it graphoidal cover} of a graph $ G $ is a collection $ \psi $ of (not necessarily open) paths in $ G $ such that every vertex of $ G $ is an internal vertex of at most one path in $ \psi $ ad every edge of $ G $ is in exactly one path in $ \psi $.
Indra Rajasingh +1 more
openaire +2 more sources
, 2009 Acharya and Sampathkumar defined a graphoidal cover as a partition of edges into internally disjoint (not necessarily open) paths. If we consider only open paths in the above definition then we call it as a graphoidal path cover.
Somasundaram, S. +2 more
openaire +3 more sources
On label graphoidal covering number-I
Transactions on Combinatorics, 2012 Let G = (V,E) be a graph with p vertices and q edges. An acyclicgraphoidal cover of G is a collection of paths in G which are internallydisjointand covering each edge of the graph exactly once. Let f : V !{1, 2, . . . , p} be a bijective labeling of the vertices of G.
Sahul Hamid, Ismail +1 more
openaire +2 more sources