Abstract
A side skirt is a planar rooted tree T, T≠P2, where the root of T is a vertex of degree at least two, and all other vertices except the leaves are of degree at least three. A reduced Halin graph or a skirted graph is a plane graph G=T∪P, where T is a side skirt, and P is a path connecting the leaves of T in the order determined by the embedding of T. The structure of reduced Halin or skirted graphs contains both symmetry and asymmetry. For n≥2 and Pn=v1v2v3⋯vn as a path of length n−1, we call the Cartesian product of a graph G and a path Pn, the n-generalized prism over a graph G. We have known that the n-generalized prism over a skirted graph is Hamiltonian. To support the Bondy’s metaconjecture from 1971, we show that the n-generalized prism over a skirted graph is pancyclic.
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 callDisclaimer: 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.
