Abstract
<abstract> In this paper, we have used two different proof techniques to show the Hamilton-connectedness of graphs. By using the vertex connectivity and Hamiltoniancity of graphs, we construct an infinite family of Hamilton-connected convex polytope line graphs whose underlying family of convex polytopes is not Hamilton-connected. By definition, we constructed two more infinite families of Hamilton-connected convex polytopes. As a by-product of our results, we compute exact values of the detour index of the families of Hamilton-connected convex polytopes. Finally, we classify the Platonic solids according to their Hamilton-connectedness and Hamilton-laceability properties. </abstract>
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.
