Results 1 to 10 of about 80 (47)
Domination in graphoidally covered graphs: Least-kernel graphoidal graphs-II
AKCE International Journal of Graphs and Combinatorics, 2018 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
Purnima Gupta, Rajesh Singh
doaj +6 more sources
On label graphoidal covering number-I [PDF]
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, . . .
Arumugaperumal Anitha +1 more
doaj +3 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 +4 more sources
On graphs whose graphoidal domination number is one
AKCE International Journal of Graphs and Combinatorics, 2015 Given a graph G=(V,E), a set ψ of non-trivial paths, which are not necessarily open, called ψ-edges, is called a graphoidal cover of G if it satisfies the following conditions: (GC−1) Every vertex of G is an internal vertex of at most one path in ψ, and (
B.D. Acharya, Purnima Gupta, Deepti Jain
doaj +4 more sources
Acyclic graphoidal covers and path partitions in a graph
Discrete Mathematics, 1998 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
S Arumugam
exaly +4 more sources
Truly non-trivial graphoidal graphs
AKCE International Journal of Graphs and Combinatorics, 2022 A graphoidal cover of a graph G is a collection [Formula: see text] of non-trivial paths in G, which are not necessarily open, such that every vertex of G is an internal vertex of at most one path in [Formula: see text] and every edge of G is in exactly ...
Rajesh Singh, Purnima Gupta, S. Arumugam
doaj +3 more sources
Graphoidal graphs and graphoidal digraphs: a generalization of line graphs
AKCE International Journal of Graphs and Combinatorics, 2020 A graphoidal cover of a graph G is a collection ψ of paths (not necessarily open) in G such that each path in ψ has at least two vertices, 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 Let
S. Arumugam, Jay S. Bagga
doaj +2 more sources
On graphoidal length of a tree in terms of its diameter
AKCE International Journal of Graphs and Combinatorics, 2020 A graphoidal cover of a graph G is a set Ψ of non-trivial paths (which are not necessarily open) in G 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 +2 more
doaj +2 more sources
The distinguishing number and the distinguishing index of line and graphoidal graph(s)
AKCE International Journal of Graphs and Combinatorics, 2020 The distinguishing number (index) () of a graph is the least integer such that has a vertex labeling (edge labeling) with labels that is preserved only by a trivial automorphism.
Saeid Alikhani, Samaneh Soltani
doaj +2 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