Results 1 to 10 of about 22 (21)
Induced label graphoidal graphs [PDF]
Acta Universitatis Sapientiae, Informatica, 2014 Abstract Let G be a non-trivial, simple, finite, connected and undirected graph of order n and size m. An induced acyclic graphoidal decomposition (IAGD) of G is a collection ψ of non-trivial and internally disjoint induced paths in G such that each edge of G lies in exactly one path of ψ. For a labeling f : V → {1, 2, 3, . . . ,n}, let ↑
Sahul Hamid Ismail, Joseph Mayamma
openaire +5 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
Some of the next articles are maybe not open access.
The distinguishing number and the distinguishing index of line and graphoidal graph(s)
AKCE International Journal of Graphs and Combinatorics, 2020Saeid Alikhani, Samaneh Soltani
exaly
Truly non-trivial graphoidal graphs
AKCE International Journal of Graphs and Combinatorics, 2022Rajesh Singh +2 more
exaly
Graphoidal graphs and graphoidal digraphs: a generalization of line graphs
AKCE International Journal of Graphs and Combinatorics, 2020S Arumugam
exaly
On graphoidal length of a tree in terms of its diameter
AKCE International Journal of Graphs and Combinatorics, 2020Purnima Gupta, Rajesh Singh
exaly
Bounds on Graphoidal Length of a Graph
Electronic Notes in Discrete Mathematics, 2016S Arumugam, Purnima Gupta
exaly
Graphoidal Length and Graphoidal Covering Number of a Graph
Lecture Notes in Computer Science, 2017Purnima Gupta, S Arumugam, Arumugam S
exaly
On graphs whose graphoidal domination number is one
AKCE International Journal of Graphs and Combinatorics, 2015Purnima Gupta, Deepti Jain
exaly