Hamilton-connectedness and Hamilton-laceability of planar geometric graphs with applications

Hamilton-connectedness and Hamilton-laceability of planar geometric graphs with applications

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 no...

Description complète

Détails bibliographiques
Auteurs principaux: Suliman Khan, Sakander Hayat, Asad Khan, Muhammad Yasir Hayat Malik, Jinde Cao
Format: Article
Langue:English
Publié: AIMS Press 2021-02-01
Collection:AIMS Mathematics
Sujets:
graph
hamiltonian path
hamiltonian cycle
hamilton-connected graph
detour index
np-complete problems
platonic solids
convex polytopes
Accès en ligne:http://www.aimspress.com/article/doi/10.3934/math.2021235?viewType=HTML

Internet

http://www.aimspress.com/article/doi/10.3934/math.2021235?viewType=HTML

Documents similaires