On Hamilton-Connectivity and Detour Index of Certain Families of Convex Polytopes

• Published in: Mathematical problems in engineering Vol. 2021; pp. 1 - 18
• Main Authors: Hayat, Sakander, Malik, Muhammad Yasir Hayat, Ahmad, Ali, Khan, Suliman, Yousafzai, Faisal, Hasni, Roslan
• Format: Journal Article
• Language: English
• Published: New York Hindawi 2021; Hindawi Limited
• Subjects: Apexes; Computational geometry; Connectivity; Convexity; Engineering; Euclidean geometry; Graph theory; Graphs; Labeling; Polytopes
• ISSN: 1024-123X; 1563-5147
• DOI: 10.1155/2021/5553216

A convex polytope is the convex hull of a finite set of points in the Euclidean space ℝn. By preserving the adjacency-incidence relation between vertices of a polytope, its structural graph is constructed. A graph is called Hamilton-connected if there exists at least one Hamiltonian path between any of its two vertices. The detour index is defined to be the sum of the lengths of longest distances, i.e., detours between vertices in a graph. Hamiltonian and Hamilton-connected graphs have diverse applications in computer science and electrical engineering, whereas the detour index has important applications in chemistry. Checking whether a graph is Hamilton-connected and computing the detour index of an arbitrary graph are both NP-complete problems. In this paper, we study these problems simultaneously for certain families of convex polytopes. We construct two infinite families of Hamilton-connected convex polytopes. Hamilton-connectivity is shown by constructing Hamiltonian paths between any pair of vertices. We then use the Hamilton-connectivity to compute the detour index of these families. A family of non-Hamilton-connected convex polytopes has also been constructed to show that not all convex polytope families are Hamilton-connected.