Hamilton Connectivity of Convex Polytopes with Applications to Their Detour Index

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. 1e detour index of a graph is defined to be the sum of lengths of detours between all the unordered pairs of vertices.1e 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 nonHamilton-connected convex polytopes is also constructed, which, in turn, shows that not all convex polytopes are Hamiltonconnected. By using Hamilton connectivity of these families of graphs, we compute exact analytical formulas of their detour index.

[1]  Hong-Jian Lai,et al.  Spectral analogues of Erdős' theorem on Hamilton-connected graphs , 2019, Appl. Math. Comput..

[2]  Bing Wei.  Hamiltonian paths and hamiltonian connectivity in graphs , 1993, Discret. Math..

[3]  A. Ashrafi,et al.  Distance and Detour Matrices of an Infinite Class of Dendrimer Nanostars , 2010 .

[4]  Ali Ahmad,et al.  ON CLASSES OF REGULAR GRAPHS WITH CONSTANT METRIC DIMENSION , 2013 .

[5]  Jinde Cao,et al.  The resistance distances of electrical networks based on Laplacian generalized inverse , 2015, Neurocomputing.

[6]  M. Bača,et al.  Vertex-magic Total Labeling of Generalized Petersen Graphs and Convex Polytopes , 2006 .

[7]  Ruo-Wei Hung,et al.  The Hamiltonian Connectivity of Alphabet Supergrid Graphs , 2019 .

[8]  Carsten Thomassen,et al.  Hamiltonian-connected tournaments , 1980, J. Comb. Theory, Ser. B.

[9]  Hong-Jian Lai,et al.  Generalized honeycomb torus is Hamiltonian , 2004, Inf. Process. Lett..

[10]  I. Gutman,et al.  Wiener Index of Trees: Theory and Applications , 2001 .

[11]  István Lukovits.  Indicators for Atoms Included in Cycles , 1996, J. Chem. Inf. Comput. Sci..

[12]  Zlatko Mihalić,et al.  On computing the molecular detour matrix , 1997 .

[13]  Ligong Wang,et al.  Signless Laplacian spectral conditions for Hamilton-connected graphs with large minimum degree , 2017, Linear Algebra and its Applications.

[14]  Tudor Zamfirescu,et al.  The Property of Hamiltonian Connectedness in Toeplitz Graphs , 2020, Complex..

[15]  István Lukovits,et al.  On Calculation of the Detour Index , 1997, J. Chem. Inf. Comput. Sci..

[16]  THE EDGE VERSIONS OF DETOUR INDEX , 2009 .

[17]  Tomáš Vetrík.  On the Metric Dimension of Directed and Undirected Circulant Graphs , 2020, Discuss. Math. Graph Theory.

[18]  Sakander Hayat,et al.  Binary Locating-Dominating Sets in Rotationally-Symmetric Convex Polytopes , 2018, Symmetry.

[19]  Shaohui Wang,et al.  Zagreb Indices and Multiplicative Zagreb Indices of Eulerian Graphs , 2019 .

[20]  Gerta Rücker,et al.  Symmetry-Aided Computation of the Detour Matrix and the Detour Index , 1998, J. Chem. Inf. Comput. Sci..

[21]  Sonja Nikolic,et al.  The Detour Matrix in Chemistry , 1997, J. Chem. Inf. Comput. Sci..

[22]  Minimum Detour Index of Bicyclic Graphs , 2012 .

[23]  Martin Baĉa.  On Magic Labellings of Convex Polytopes , 1992 .

[25]  M. Imran,et al.  Computing the metric dimension of convex polytopes generated by wheel related graphs , 2016 .

[26]  Tomás Vetrík,et al.  Metric dimension of Cayley digraphs of split metacyclic groups , 2020, Theor. Comput. Sci..

[27]  Musavarah Sarwar,et al.  On the metric dimension of two families of convex polytopes , 2016 .

[28]  Qiannan Zhou,et al.  Some sufficient spectral conditions on Hamilton-connected and traceable graphs , 2017 .

[29]  Hong-Jian Lai,et al.  Hamiltonian-connected graphs , 2008, Comput. Math. Appl..

[30]  Gary Chartrand,et al.  The square of a block is Hamiltonian connected , 1974 .

[31]  Milica Stojanovic,et al.  Minimal doubly resolving sets and the strong metric dimension of some convex polytopes , 2012, Appl. Math. Comput..

[32]  Frank Werner,et al.  Hamiltonian properties of triangular grid graphs , 2008, Discret. Math..

[33]  Qian Zhao,et al.  The hamiltonicity of generalized honeycomb torus networks , 2015, Inf. Process. Lett..

[34]  Frank Harary,et al.  Graph Theory , 2016 .

[35]  Dong Li,et al.  Complete characterization of bicyclic graphs with minimal Kirchhoff index , 2016, Discret. Appl. Math..

[36]  Yong Lu,et al.  Wiener index and Harary index on Hamilton-connected graphs with large minimum degree , 2018, Discret. Appl. Math..

[37]  Muhammad Imran,et al.  On families of convex polytopes with constant metric dimension , 2010, Comput. Math. Appl..

[38]  Roberto W. Frucht,et al.  A canonical representation of trivalent hamiltonian graphs , 1977, J. Graph Theory.

[39]  Iain A. Stewart,et al.  Sufficient conditions for Hamiltonicity in multiswapped networks , 2017, J. Parallel Distributed Comput..

[41]  Ana Simic,et al.  The binary locating-dominating number of some convex polytopes , 2017, Ars Math. Contemp..

[42]  Jou-Ming Chang,et al.  Panconnectivity, fault-tolerant hamiltonicity and hamiltonian-connectivity in alternating group graphs , 2004 .

[43]  Sakander Hayat,et al.  On the fault-tolerant metric dimension of convex polytopes , 2018, Appl. Math. Comput..

[44]  Shaojian Qu,et al.  On Mixed Metric Dimension of Rotationally Symmetric Graphs , 2020, IEEE Access.

[45]  Jinde Cao,et al.  Applications of Laplacian spectra for n-prism networks , 2016, Neurocomputing.

[46]  Bo Zhou,et al.  Detour index of a class of unicyclic graphs , 2010 .

[47]  Jing Zhao,et al.  On the generalized adjacency, Laplacian and signless Laplacian spectra of the weighted edge corona networks , 2020 .

[48]  Bo Zhou,et al.  ON DETOUR INDEX , 2010 .

[50]  Muhammad Imran,et al.  On the metric dimension of rotationally-symmetric convex polytopes , 2016 .