Results 1 to 10 of about 24 (22)
On label graphoidal covering number-I
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 +3 more sources
ON THE LABEL GRAPHOIDAL COVERING NUMBER-II
Let G = (V, E) be a graph with p vertices and q edges. An acyclic graphoidal cover of G is a collection ψ of paths in G which are internally disjoint and covering each edge of the graph exactly once. Let f : V → {1, 2, …, p} be a labeling of the vertices of G. Let ↑Gf be the directed graph obtained by orienting the edges uv of G from u to v provided f(
I. Sahul Hamid, A. Anitha
openaire +3 more sources
Some of the next articles are maybe not open access.
Truly non-trivial graphoidal graphs
AKCE International Journal of Graphs and Combinatorics, 2022Rajesh Singh +2 more
exaly
On graphoidal length of a tree in terms of its diameter
AKCE International Journal of Graphs and Combinatorics, 2020Purnima Gupta, Rajesh Singh
exaly
Graphoidal graphs and graphoidal digraphs: a generalization of line graphs
AKCE International Journal of Graphs and Combinatorics, 2020S Arumugam
exaly
Graphoidal Length and Graphoidal Covering Number of a Graph
Lecture Notes in Computer Science, 2017Purnima Gupta, S Arumugam, Arumugam S
exaly
Bounds on Graphoidal Length of a Graph
Electronic Notes in Discrete Mathematics, 2016S Arumugam, Purnima Gupta
exaly
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
On Graphs Whose Graphoidal Length Is Half of Its Size
Lecture Notes in Computer Science, 2017Purnima Gupta
exaly

