Results 1 to 10 of about 23 (22)

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 ↑
Mayamma Joseph
exaly   +4 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, Anitha, Arumugaperumal   +1 more
openaire   +2 more sources

ON THE LABEL GRAPHOIDAL COVERING NUMBER-II

Discrete Mathematics, Algorithms and Applications, 2011
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   +2 more sources

Truly non-trivial graphoidal graphs

AKCE International Journal of Graphs and Combinatorics, 2022
Rajesh Singh, Purnima Gupta, S Arumugam   +2 more
exaly  

The distinguishing number and the distinguishing index of line and graphoidal graph(s)

AKCE International Journal of Graphs and Combinatorics, 2020
Saeid Alikhani, Samaneh Soltani
exaly  

Graphoidal graphs and graphoidal digraphs: a generalization of line graphs

AKCE International Journal of Graphs and Combinatorics, 2020
S Arumugam
exaly  

On graphoidal length of a tree in terms of its diameter

AKCE International Journal of Graphs and Combinatorics, 2020
Purnima Gupta, Rajesh Singh
exaly  

Graphoidal Length and Graphoidal Covering Number of a Graph

Lecture Notes in Computer Science, 2017
Purnima Gupta, S Arumugam, Arumugam S
exaly  

Bounds on Graphoidal Length of a Graph

Electronic Notes in Discrete Mathematics, 2016
S Arumugam, Purnima Gupta
exaly  

Ascending graphoidal tree cover for product graphs

Journal of Discrete Mathematical Sciences and Cryptography, 2013
V Maheswari
exaly