laceability number
1 article · search the full text for this term
-
Laceability in Line Graphs and Jump Graphs of Petersen Graph
Abstract: A simple connected graph is Hamiltonian laceable if there exists a Hamiltonian path between every pair of distinct vertices at an odd distance in it. is Hamiltonian-t-laceable (t*-laceable) if there exists a Hamiltonian path in between every pair (at least one pair) of vertices u and v in with the property Manjunath et al. obtained Hamiltonian laceability properties in line graphs and jump graphs of some graphs. In this paper …
Published in Research & Reviews: Discrete Mathematical Structures · Vol. 3, Issue 2, 2016 · pp. 5–13 Read article