Hamilton Connectivity of Convex Polytopes with Applications to Their Detour Index. (25th January 2021)

• Record Type: Journal Article
• Authors: Hayat, Sakander; Khan, Asad; Khan, Suliman; Liu, Jia-Bao
• Other Names: Uddin M. Irfan Academic Editor.
• Is Part Of: Complexity. Volume 2021(2021)
• Publication Date: 2021-01-25
• Subjects: Chaotic behavior in systems -- Periodicals; Complexity (Philosophy) -- Periodicals; 003
• DOI: 10.1155/2021/6684784
• Languages: English
• ISSNs: 1076-2787

Abstract

Abstract : A connected graph is called Hamilton-connected if there exists a Hamiltonian path between any pair of its vertices. Determining whether a graph is Hamilton-connected is an NP-complete problem. Hamiltonian and Hamilton-connected graphs have diverse applications in computer science and electrical engineering. The detour index of a graph is defined to be the sum of lengths of detours between all the unordered pairs of vertices. The detour index has diverse applications in chemistry. Computing the detour index for a graph is also an NP-complete problem. In this paper, we study the Hamilton-connectivity of convex polytopes. We construct three infinite families of convex polytopes and show that they are Hamilton-connected. An infinite family of non-Hamilton-connected convex polytopes is also constructed, which, in turn, shows that not all convex polytopes are Hamilton-connected. By using Hamilton connectivity of these families of graphs, we compute exact analytical formulas of their detour index.