Abstract
A connected graph G is termed Hamiltonian-t-laceable (t*-laceable) if there exists in G a Hamiltonian path between every pair (at least one pair) of its vertices u and v with the property d(u,v) = t. The Tadpole graph is the graph obtained by joining a cycle graph Cm to a path graph Pn with a bridge. In this paper, we discuss the laceability properties associated with the Tadpole graph.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Journal For Innovative Engineering and Management Research
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
