Results 41 to 47 of about 80 (47)
Some of the next articles are maybe not open access.
On graphs whose acyclic graphoidal covering number is one less than its cyclomatic number.
Ars Comb., 2004Summary: A graphoidal cover of a graph \(G\) is a collection \(\psi\) of (not necessarily open) paths in \(G\) such that every vertex of \(G\) is in internal vertex of at most one path in \(\psi\) and every edge of \(G\) is an exactly one path in \(\psi\).
S. Arumugam +2 more
openaire +1 more source
SIMPLE GRAPHOIDAL COVER ON TENSOR PRODUCT OF GRAPHS
Advances and Applications in Discrete Mathematics, 2019Narayanan, G. Venkat +2 more
openaire +1 more source
Simple acyclic graphoidal covers in a graph. [PDF]
Australas. J Comb., 2007 S. Arumugam 0001, I. Sahul Hamid
openaire
Bounds on Graphoidal Length of a Graph
Electronic Notes in Discrete Mathematics, 2016S Arumugam, Purnima Gupta
exaly
On Graphs Whose Graphoidal Length Is Half of Its Size
Lecture Notes in Computer Science, 2017Purnima Gupta
exaly