Open AccessTadpole graphs and their laceability.
Publication year - 2021
Publication title -
international journal for innovative engineering and management research
Language(s) - English
Resource type - Journals
ISSN - 2456-5083
DOI - 10.48047/ijiemr/v10/i04/44
Subject(s) - combinatorics , hamiltonian path , mathematics , graph , discrete mathematics , tadpole (physics) , distance hereditary graph , complement graph , complete graph , graph power , line graph , physics , quantum mechanics
A connected graph G is termed Hamiltonian-t-laceable (t*-laceable) if there exists in G aHamiltonian path between every pair (at least one pair) of its vertices u and v with the propertyd(u,v) = t. The Tadpole graph is the graph obtained by joining a cycle graph Cm to a path graphPn with a bridge. In this paper, we discuss the laceability properties associated with the Tadpolegraph.