Hamilton Connectivity of Convex Polytopes with Applications to Their Detour Index

Hayat, Sakander; Khan, Asad; Khan, Suliman; Liu, Jia-Bao

doi:https://doi.org/10.1155/2021/6684784

Complexity

On this page

Abstract Introduction and Preliminaries Data Availability Conflicts of Interest Authors’ Contributions Acknowledgments References Copyright Related Articles

Research Article | Open Access

Volume 2021 | Article ID 6684784 | https://doi.org/10.1155/2021/6684784

Hamilton Connectivity of Convex Polytopes with Applications to Their Detour Index

Sakander Hayat,¹Asad Khan,²Suliman Khan,¹and Jia-Bao Liu³

Academic Editor: M. Irfan Uddin

Received01 Nov 2020

Revised21 Nov 2020

Accepted30 Nov 2020

Published25 Jan 2021

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.

1. Introduction and Preliminaries

All graphs in this paper are simple, loopless, finite, and connected.

A cycle in a graph is called Hamiltonian if it travels all the vertices of . Moreover, a path in is called Hamiltonian path if it traverses all the vertices of . Not every graph contains a Hamiltonian cycle. For instance, any tree is an acyclic graph, so it cannot contain a Hamiltonian cycle. However, a tress may still contain a Hamiltonian path. A graph is called Hamiltonian if there exist a Hamiltonian cycle in it. By definition, any cycle graph or a clique graph are Hamiltonian. Furthermore, is called traceable if it contains a Hamiltonian path. Of course all Hamiltonian graphs are traceable. However, there exist graphs which are traceable but not Hamiltonian. The first nontrivial example which comes in mind immediately is the so-called Petersen graph which is traceable but not Hamiltonian.

A graph which contains a Hamiltonian path between every two vertices of is called Hamilton connected. They were introduced by Ore [1] in 1963. Frucht [2] studied a canonical representation of trivalent Hamiltonian graphs. A bipartite can never be a Hamilton-connected, since there cannot exist a Hamiltonian path between vertices of the same partite set. In that case, a bipartite graph is called Hamilton-laceable if there exist Hamiltonian paths between vertices of different partite sets. There is an extensive literature available on Hamiltoniancity and Hamilton-connectivity of graphs, see, for instance, [3–7].

Chartrand et al. [8] showed that the square of a block graph is Hamilton-connected. Thomasson [9] studied Hamilton-connected tournaments in graphs. Chang et al. [10] studied panconnectivity, fault-tolerant Hamiltonicity, and Hamiltonian-connectivity in alternating group graphs by considering them as interconnection networks. Kewen et al. [11] derived a sufficient condition for a graph to be Hamilton-connected. Zhou and Wang [12] proved certain sufficient conditions for a graph to be Hamilton-connected in terms of the edge number, the spectral radius, and the signless Laplacian spectral radius of the graph. Zhou et al. [13] calculated the Wiener and Harary indices of Hamilton-connected graphs with large diameter. Wei et al. [14] derived some spectral analogues of Erdös’ theorems for Hamilton-connected graphs. Hung et al. [15] studied Hamilton-connectivity of alphabet grid graphs. Zhou et al. [16] extended a result of Fiedler and Nikiforov and derived signless Laplacian spectral conditions for Hamilton-connected graphs with large minimum degree. Recently, Shabbir et al. [17] studied Hamilton-connectivity in Teoplitz graphs.

By preserving the vertex-edge incidence relation in convex polytopes, their graphs are constructed. Bača [18–20] was the first researcher to consider these families of geometric graphs. In [20] (resp. [19]), Bača studied the problem of magic (resp. graceful and antigraceful) labeling of convex polytopes, whereas, in [18], the problem of face antimagic labeling of convex polytopes was studied. Miller et al. [21] studied the vertex-magic total labeling of convex polytopes. Imran et al. [22–24] computed the minimum metric dimension of various infinite families of convex polytopes. In particular, they showed that these infinite families of convex polytopes have constant metric dimension. Malik et al. [25] also constructed two infinite families of convex polytopes having constant metric dimension. Other closely related infinite families of graphs with constant metric dimension are studied in [26]. Kratica et al. [27] studied the strong metric dimension of certain infinite families of convex polytopes by constructing their doubly resolving sets. The fault-tolerant metric dimension (resp. mixed metric dimension) of convex polytopes was studied by Raza et al. [28] (resp. Raza et al. [29]). Metric dimension of other related families of graphs such as Cayley graph is studied by Vetrik and Abas [30, 31]. The binary locating-dominating number of convex polytopes is studied by Simić et al. [32] and Raza et al. [33]. The open-locating-dominating number of certain convex polytopes has recently been studied by Savic et al. [34]. Liu et al. [35–39] studied application of various graph parameters in electrical networks and related systems.

For a graph , let be the length of a longest path (i.e., detour) between vertices and of . The detour index [40] is defined to be the sum of lengths of all detours between unordered pairs of vertices in . The detour index of a graph is usually denoted by :

The detour index has important applications in chemistry. Applications of this parameter in quantitative structure activity and property relationship models were put forward by Lukovits [41]. Besides giving further applications of the detour index, Trinajstić et al. [42] conducted a comparative analysis with the Wiener index in terms of applicability in correlating structure boiling point of organic compounds. Moreover, its further applications in predicting the normal boiling points of cyclic and acyclic alkanes were studied by Rücker and Rücker [43].

An algorithm for tracing the detour between two vertices in a graph was proposed by Lukovits and Razinger [44]. They also applied their algorithm in detecting detours and computing the detour index of graphs corresponding to fused bicyclic skeletons. Rücker and Rücker [43] and Trinajstić et al. [45] proposed certain computer methods to trace out detours and thus calculation of the detour index of graphs. It has already been shown in [46] that the problem of finding the detour index of a given graph is computationally NP-complete. Trinajstić et al. [45] also proposed a method of calculating the detour matrix of reasonably small sizes. Note that the detour index is equal to the sum of all the entries of the detour matrix dividing by two.

Mahmiani et al. [47] proposed the edge versions of the detour index and studied their mathematical properties. Zhou and Cai [48] proved some upper and lower bounds on the detour index of graphs. Qi and Zhou [49] studied minimum uncyclic graphs with respect to the detour index. Du [50] studied the minimum detour index of bicyclic graphs. Fang et al. [51] characterized the minimum detour index of some families of tricyclic graphs. Karbasioun et al. [52] studied the applications of the detour index in infinite families of nanostar dendrimers. Wu and Deng [53] computed the detour index for a chain of C20 fullerenes. Kaladevi [54] studied spectral properties of the detour index in relation with the Laplacian energy of graphs. Recently, Abdullah and Omar [55] introduced the restricted edge version of the detour index and studied it for some families of graphs.

We end this section with an important and well-known result bounding the detour index in terms of graph parameters.

Theorem 1 (see [56]). Let be a connected graph with vertices. Then,with left equality if and only if and with right equality if and only if is Hamilton-connected.

In this paper, we study the Hamilton connectivity of certain infinite families of convex polytopes. More precisely, we construct three infinite families of Hamilton-connected convex polytopes. Moreover, we construct an infinite family non-Hamilton-connected convex polytope. By using Hamilton-connectivity of these families of graphs, we compute exact formulas of their detour index.

2. Hamilton Connectivity and the Detour Index of

In this section, we show that the -dimensional infinite family of convex polytopes is Hamilton-connected. Afterwards, we use its Hamiltonconnectivity to find analytical exact expression of the detour index of the graph .

For , the graph of convex polytope is defined in [20]. It has the vertex setand edge set

By convention, we suppose that , , and . See Figure 1 to view the -dimensional convex polytope .

For a positive integer , we write (resp. ) if is even (resp. odd).

Theorem 2. The -dimensional convex polytope , with , is Hamilton-connected.

Proof. We prove this result by definition. For this, we have to show that there exists a Hamiltonian path between any pair of vertices of .
Let be a Hamiltonian path between vertices and in . Let such that , , and , see, Figure 1. Case 1: and , . Case 1.1: : Case 1.2: : Case 2: and , . Case 2.1: : Case 2.2: : Case 3: and , . Case 3.1: : Case 3.2: : Case 4: and , . Case 4.1: : Case 4.2: : Case 4.3: : Case 5: and , . Case 5.1: : Case 5.2: : Case 5.3: : Case 6: and , . Case 6.1: : Case 6.2: : Case 6.3: : Case 7: and , . Case 7.1: : Case 7.2: : Case 7.3: : Case 8: and , . Case 8.1: : Case 8.2: : Case 8.3: : Case 9: and , . Case 9.1: : Case 9.2: :Existence of Hamiltonian path between any two vertices of the -dimensional convex polytope completes the proof.
Using Theorems 1 and 2, the following proposition computes the detour index of of .

Proposition 1. Let , where . Then, the detour index of is

Proof. The number of vertices in the graph is . Replacing with in Theorem 1 shows the proposition.

3. Hamilton Connectivity and the Detour Index of

In this section, we show that the -dimensional infinite family of convex polytopes is Hamilton-connected. Then, we use its Hamilton connectivity to find analytical exact expression of the detour index of the graph .

The graph of convex polytope (Figure 2) consists of 3-sided faces, 4-sided faces, and a pair of -sided faces [57]. We have

See Figure 2 to view the -dimensional convex polytope .

Next, we show the main result of this section.

Theorem 3. The -dimensional convex polytope , with , is Hamilton-connected.

Proof. We prove it by definition. This implies that we need to show the existence of Hamiltonian paths between any pair of vertices of .
Let be a Hamiltonian path between vertices and in . By following the labeling of vertices exhibited in Figure 2, we show the existence of Hamiltonian paths between vertices of in a number of cases. Case 1: and , . Case 1.1: :Case 1.2: : Case 2: : Case 2.1: :Case 2.2: : Case 3: and , . Case 3.1: :Case 3.2: :Case 3.3: : Case 4: and , . Case 4.1: :Case 4.2: :Case 4.3: : Case 5: and , . Case 5.1: :Case 5.2: :Case 5.3: : Case 6: and , . Case 6.1: :Case 6.2: : Case 7: and , . Case 7.1: :Case 7.2: : Case 8: and , . Case 8.1: :Case 8.2: : Case 9: and , . Case 9.1: :Case 9.2: :Case 9.3: : Case 10: and , . Case 10.1: :Case 10.2: :Case 10.3: : Case 11: and , . Case 11.1: :Case 11.2: : Case 12: and , . Case 12.1: :Case 12.2: :Case 12.3: : Case 13: and , . Case 13.1: :Case 13.2: : Case 14: and , . Case 14.1: :Case 14.2: :Case 14.3: : Case 15: and , . Case 15.1: :Case 15.2: :Case 15.3: : Case 16: and , . Case 16.1: :Case 16.2: :Existence of Hamiltonian paths between any two vertices of the -dimensional convex polytope completes the proof.
Using Theorems 1 and 3, the following proposition computes the detour index of .

Proposition 2. Let , where . Then, the detour index of is

Proof. The number of vertices in graph is . Replacing with in Theorem 1 completes the proof.

4. Hamilton Connectivity and the Detour Index of

This section shows that the -dimensional convex polytope is Hamilton-connected. Its Hamilton connectivity is then used to calculate exact analytical formula of the detour index of .

Malik et al. [25] introduced the family of -dimensional convex polytope . We have

See Figure 3 to view the -dimensional convex polytope .

Theorem 4. The graph -dimensional convex polytope , with , is Hamilton-connected.

Proof. We prove this result by definition. For this, we have to show that there exists a Hamiltonian path between any pair of vertices of .
Let be a Hamiltonian path between vertices and in . Let such that , , , and . We divide the construction of Hamiltonian paths in into a number of cases as follows. Case 1: and , . Case 1.1: :Case 1.2: : Case 2: and , . Case 2.1: :Case 2.2: : Case 3: and , . Case 3.1: :Case 3.2: : Case 4: and , . Case 4.1: :Case 4.2: : Case 5: and , . Case 5.1: :Case 5.2: : Case 6: and , : Case 6.1: :Case 6.2: : Case 7: and , Case 7.1: :Case 7.2: : Case 8: and , . Case 8.1: :Case 8.2: : Case 9: and , . Case 9.1: :Case 9.2: : Case 10: and , . Case 10.1: :Case 10.2: : Case 11: and , . Case 11.1: :Case 11.2: : Case 12: and , . Case 12.1: :Case 12.2: :Case 12.3: : Case 13: and , . Case 13.1: :Case 13.2: :Case 13.3: : Case 14: and , . Case 14.1: :Case 14.2: : Case 15: and , . Case 15.1: :Case 15.2: : Case 16: and , . Case 16.1: :Case 16.2: : Case 17: and , . Case 17.1: :Case 17.2: : Case 18: and , . Case 18.1: : Case 18.2: : Case 19: and , . Case 19.1: :Case 19.2: : Case 20: and , . Case 20.1: :Case 20.2: :Case 20.3: : Case 21: and , . Case 21.1: :Case 21.2: : Case 22: and , . Case 22.1: :Case 22.2: : Case 23: and , . Case 23.1: :Case 23.2: : Case 24: and , . Case 24.1: :Case 24.2: : Case 25: and , . Case 25.1: :Case 25.2: :Existence of Hamiltonian paths between any two vertices of the -dimensional convex polytope completes the proof. □
Using Theorems 1 and 4, the following proposition computes the detour index of .

Proposition 3. Let , where . Then the detour index of is

Proof. The number of vertices in graph is . Replacing with in Theorem 1 completes the proof.

5. A Family of Non-Hamilton-connected Convex Polytopes

For , by , we denote the graph of convex polytope defined in [24] which consists of number of 3-sided faces, number of 4-sided faces, and number of pentagonal faces, see Figure 4.

Mathematically, the vertex set of consists of four layers of vertices, i.e., , , , , and . That is to say that . Accordingly, the edge set of is as follows:

Note that arithmetics in the subscripts is performed modulo . Layer comprising vertices is called the first layer. Similarly, layers composed by vertices , , , and are called second layer, third layer, fourth layer, and fifth layer, respectively. Note that first, second, fourth, and fifth layers form cycles of length .

The following result shows that the infinite family of convex polytopes is non-Hamilton-connected.

Theorem 5. The -dimensional convex polytope , with , is non-Hamilton-connected.

Proof. It is enough to show that there exist two vertices in the -dimensional convex polytope such that no Hamiltonian path exists between them.
It is easy to see that there exists no Hamiltonian path between any two vertices at distance two on the outer layer, i.e., between and if is even and between consecutive vertices on the outer layer, i.e., and if is odd, where such that subscripts are taken modulo . This shows that the -dimensional convex polytope is non-Hamilton-connected.

6. Conclusion

Determining whether or not a graph is Hamilton-connected is NP-complete graph. Thus, it is natural to study the Hamilton-connectivity of infinite families of graphs. In this paper, we have studied Hamilton-connectivity of certain infinite families of convex polytopes. We construct three infinite families of convex polytopes which have been shown to be Hamilton-connected. Moreover, one infinite family is shown to be non-Hamilton-connected which shows that not all the convex polytopes are Hamilton-connected. As a by-product, we compute the detour index of Hamilton-connected families of convex polytopes.

As future directions, we propose the following problems:

Problem 1. Is there any other way to show Hamilton-connectivity of a given graph?

Problem 2. Baca [18] introduced a family of convex polytopes. Determine whether is Hamilton-connected.

Problem 3. Imran et al. [57] introduced the family of convex polytopes. Determine whether or not is Hamilton-connected.

Data Availability

No data were used to support the findings of the study.

Conflicts of Interest

The authors declare that they have no conflicts of interest regarding the publication of the article.

Authors’ Contributions

S. H. and A. K. devised the methodology and acquired funding. S. H. and S. K. carried out the formal analysis and data curation. S. H. and J.-B. L. wrote the original draft, reviewed the writing, and edited the manuscript. S. H., A. K., and J.-B. L. proofread the manuscript before its final submission. S. H. and A. K. contributed equally to this work.

Acknowledgments

Sakander Hayat was grateful to Dr. Muhammad Imran for providing the registration details to Mayura software. Sakander Hayat was supported by the Higher Education Commission, Pakistan, under Grant no. 20-11682/NRPU/RGM/R&D/HEC/2020. J-B. Liu was supported by Anhui Provincial Natural Science Foundation under Grant 2008085J01 and Natural Science Fund of Education Department of Anhui province under Grant no. KJ2020A0478.

References

O. Ore, “Hamilton-connected graphs,” Journal de Mathématiques Pures et Appliquées, vol. 42, pp. 21–27, 1963.
View at: Google Scholar
R. Frucht, “A canonical representation of trivalent Hamiltonian graphs,” Journal of Graph Theory, vol. 1, no. 1, pp. 45–60, 1976.
View at: Publisher Site | Google Scholar
V. S. Gordon, Y. L. Orlovich, and F. Werner, “Hamiltonian properties of triangular grid graphs,” Discrete Mathematics, vol. 308, no. 24, pp. 6166–6188, 2008.
View at: Publisher Site | Google Scholar
S. Qiang, Z. Qain, and A. Yahui, “The Hamiltonicity of generalized honeycomb torus networks,” Information Processing Letters, vol. 115, no. 2, pp. 104–111, 2005.
View at: Google Scholar
I. A. Stewart, “Sufficient conditions for Hamiltonicity in multiswapped networks,” Journal of Parallel and Distributed Computing, vol. 101, pp. 17–26, 2017.
View at: Publisher Site | Google Scholar
B. Wei, “Hamiltonian paths and Hamiltonian connectivity in graphs,” Discrete Mathematics, vol. 121, no. 1-3, pp. 223–228, 1993.
View at: Publisher Site | Google Scholar
X. Yang, D. J. Evans, H. Lai, and G. M. Megson, “Generalized honeycomb torus is Hamiltonian,” Information Processing Letters, vol. 92, no. 1, pp. 31–37, 2004.
View at: Publisher Site | Google Scholar
G. Chartrand, A. M. Hobbs, H. A. Jung, S. F. Kapoor, and C. S. J. A. Nash-Williams, “The square of a block is Hamiltonian connected,” Journal of Combinatorial Theory, Series B, vol. 16, no. 3, pp. 290–292, 1974.
View at: Publisher Site | Google Scholar
C. Thomassen, “Hamiltonian-connected tournaments,” Journal of Combinatorial Theory, Series B, vol. 28, no. 2, pp. 142–163, 1980.
View at: Publisher Site | Google Scholar
J.-M. Chang, J.-S. Yang, Y.-L. Wang, and Y. Cheng, “Panconnectivity, fault-tolerant Hamiltonicity and Hamiltonian-connectivity in alternating group graphs,” Networks, vol. 44, no. 4, pp. 302–310, 2004.
View at: Publisher Site | Google Scholar
Z. Kewen, H.-J. Lai, and J. Zhou, “Hamiltonian-connected graphs,” Computers & Mathematics with Applications, vol. 55, no. 12, pp. 2707–2714, 2008.
View at: Publisher Site | Google Scholar
Q. Zhou and L. Wang, “Some sufficient spectral conditions on Hamilton-connected and traceable graphs,” Linear and Multilinear Algebra, vol. 65, no. 2, pp. 224–234, 2017.
View at: Publisher Site | Google Scholar
Q. Zhou, L. Wang, and Y. Lu, “Wiener index and Harary index on Hamilton-connected graphs with large minimum degree,” Discrete Applied Mathematics, vol. 247, pp. 180–185, 2018.
View at: Publisher Site | Google Scholar
J. Wei, Z. You, and H.-J. Lai, “Spectral analogues of Erdős' theorem on Hamilton-connected graphs,” Applied Mathematics and Computation, vol. 340, pp. 242–250, 2019.
View at: Publisher Site | Google Scholar
R. W. Hung, F. Keshavarz-Kohjerdi, C. B. Lin, and J. S. Chen, “The Hamiltonian connectivity of alphabet supergrid graphs,” International Journal of Applied Mathematics, vol. 49, no. 1, pp. 1–10, 2019.
View at: Google Scholar
Q. Zhou, L. Wang, and Y. Lu, “Signless Laplacian spectral conditions for Hamilton-connected graphs with large minimum degree,” Linear Algebra and Its Applications, vol. 592, pp. 48–64, 2020.
View at: Publisher Site | Google Scholar
A. Shabbir, M. F. Nadeem, and T. Zamfirescu, “The property of Hamiltonian connectedness in Toeplitz graphs,” Complexity, vol. 2020, Article ID 5608720, 6 pages, 2020.
View at: Publisher Site | Google Scholar
M. Bača, “Face anti-magic labelings of convex polytopes,” Utilitas Mathematica, vol. 55, pp. 221–226, 1999.
View at: Google Scholar
M. Baca, “Labelings of two classes of convex polytopes,” Utilitas Mathematica, vol. 34, pp. 24–31, 1988.
View at: Google Scholar
M. Bača, “On magic labellings of convex polytopes,” Annals of Discrete Mathematics, vol. 51, pp. 13–16, 1992.
View at: Google Scholar
M. Miller, M. Baca, and J. A. MacDougall, “Vertex-magic total labeling of generalized Petersen graphs and convex polytopes,” Journal of Combinatorial Mathematics and Combinatorial Computing, vol. 59, pp. 89–99, 2006.
View at: Google Scholar
M. Imran, A. Q. Baig, and A. Ahmad, “Families of plane graphs with constant metric dimension,” Utilitas Mathematica, vol. 88, pp. 43–57, 2012.
View at: Google Scholar
M. Imran, S. A. U. H. Bokhary, and A. Q. Baig, “On the metric dimension of rotationally-symmetric convex polytopes,” Journal of Algebra Combinatorics Discrete Structures and Applications, vol. 3, pp. 45–59, 2015.
View at: Publisher Site | Google Scholar
M. Imran and H. M. A. Siddiqui, “Computing the metric dimension of convex polytopes generated by wheel related graphs,” Acta Mathematica Hungarica, vol. 149, no. 1, pp. 10–30, 2016.
View at: Publisher Site | Google Scholar
M. A. Malik and M. Sarwar, “On the metric dimension of two families of convex polytopes,” Afrika Matematika, vol. 27, no. 1-2, pp. 229–238, 2016.
View at: Publisher Site | Google Scholar
M. Imran, S. A. u. H. Bokhary, A. Ahmad, and A. Semaničová-feňovčíková, “On classes of regular graphs with constant metric dimension,” Acta Mathematica Scientia, vol. 33, no. 1, pp. 187–206, 2013.
View at: Publisher Site | Google Scholar
J. Kratica, V. Kovačević-Vujčić, M. Čangalović, and M. Stojanović, “Minimal doubly resolving sets and the strong metric dimension of some convex polytopes,” Applied Mathematics and Computation, vol. 218, no. 19, pp. 9790–9801, 2012.
View at: Publisher Site | Google Scholar
H. Raza, S. Hayat, and X.-F. Pan, “On the fault-tolerant metric dimension of convex polytopes,” Applied Mathematics and Computation, vol. 339, pp. 172–185, 2018.
View at: Publisher Site | Google Scholar
H. Raza, J.-B. Liu, and S. Qu, “On mixed metric dimension of rotationally symmetric graphs,” IEEE Access, vol. 8, pp. 11560–11569, 2020.
View at: Publisher Site | Google Scholar
M. Abas and T. Vetrík, “Metric dimension of Cayley digraphs of split metacyclic groups,” Theoretical Computer Science, vol. 809, pp. 61–72, 2020.
View at: Publisher Site | Google Scholar
T. Vetrik, “On the metric dimension of directed and undirected circulant graphs,” Discussiones Mathematicae Graph Theory, vol. 40, no. 1, pp. 67–76, 2020.
View at: Publisher Site | Google Scholar
A. Simić, M. Bogdanović, and J. Milošević, “The binary locating-dominating number of some convex polytopes,” Ars Mathematica Contemporanea, vol. 13, pp. 367–377, 2017.
View at: Google Scholar
H. Raza, S. Hayat, and X.-F. Pan, “Binary locating-dominating sets in rotationally-symmetric convex polytopes,” Symmetry, vol. 10, no. 12, pp. 727–745, 2018.
View at: Publisher Site | Google Scholar
A. Savic, Z. Maksimovic, and M. Bogdanovic, “The open-locating-dominating number of some convex polytopes,” FILOMAT, vol. 32, no. 2, pp. 635–642, 2018.
View at: Publisher Site | Google Scholar
J.-B. Liu, J. Cao, A. Alofi, A. AL-Mazrooei, and A. Elaiw, “Applications of Laplacian spectra for n-prism networks -Prism Networks,” Neurocomputing, vol. 198, pp. 69–73, 2016.
View at: Publisher Site | Google Scholar
J.-B. Liu and J. Cao, “The resistance distances of electrical networks based on Laplacian generalized inverse,” Neurocomputing, vol. 167, pp. 306–313, 2015.
View at: Publisher Site | Google Scholar
J.-B. Liu, X.-F. Pan, L. Yu, and D. Li, “Complete characterization of bicyclic graphs with minimal Kirchhoff index,” Discrete Applied Mathematics, vol. 200, pp. 95–107, 2016.
View at: Publisher Site | Google Scholar
J.-B. Liu, C. Wang, S. Wang, and B. Wei, “Zagreb indices and multiplicative Zagreb indices of Eulerian graphs,” Bulletin of the Malaysian Mathematical Sciences Society, vol. 42, no. 1, pp. 67–78, 2019.
View at: Publisher Site | Google Scholar
J.-B. Liu, J. Zhao, and Z. Cai, “On the generalized adjacency, Laplacian and signless Laplacian spectra of the weighted edge corona networks,” Physica A, vol. 540, p. 12307, 2020.
View at: Publisher Site | Google Scholar
I. Lukovits, “The detour index,” Croatica Chemica Acta, vol. 69, pp. 873–882, 1996.
View at: Google Scholar
I. Lukovits, “Indicators for atoms included in cycles,” Journal of Chemical Information and Computer Sciences, vol. 36, no. 1, pp. 65–68, 1996.
View at: Publisher Site | Google Scholar
N. Trinajstić, S. Nikolić, B. Lučić, D. Amić, and Z. Mihalić, “The detour matrix in chemistry,” Journal of Chemical Information and Modeling, vol. 37, pp. 631–638, 1997.
View at: Google Scholar
G. Rücker and C. Rücker, “Symmetry-aided computation of the detour matrix and the detour index,” Journal of Chemical Information and Computer Sciences, vol. 38, no. 4, pp. 710–714, 1998.
View at: Publisher Site | Google Scholar
I. Lukovits and M. Razinger, “On calculation of the detour index,” Journal of Chemical Information and Computer Sciences, vol. 37, no. 2, pp. 283–286, 1997.
View at: Publisher Site | Google Scholar
N. Trinajstić, S. Nikolić, and Z. Mihalić, “On computing the molecular detour matrix,” International Journal of Quantum Chemistry, vol. 65, pp. 415–419, 1998.
View at: Google Scholar
F. Harary, Graph Theory, Addison-Wesley, Reading, MA, USA, 1969.
A. Mahmiani, O. Khormali, and A. Iranmanesh, “The edge versions of detour index,” MATCH Communications in Mathematical and in Computer Chemistry, vol. 62, no. 2, pp. 419–431, 2009.
View at: Google Scholar
B. Zhou and X. Cai, “On detour index,” MATCH Communications in Mathematical and in Computer Chemistry, vol. 63, pp. 199–210, 2010.
View at: Google Scholar
X. Qi and B. Zhou, “Detour index of a class of unicyclic graphs,” Filomat, vol. 24, no. 1, pp. 29–40, 2010.
View at: Google Scholar
C. Du, “Minimum detour index of bicyclic graphs, MATCH Commun,” Mathematical and in Computer Chemistry, vol. 68, no. 1, pp. 357–370, 2012.
View at: Google Scholar
W. Fang, Z. Q. Cai, and X. X. Li, “Minimum detour index of tricyclic graphs,” Journal of Chemistry, vol. 2019, Article ID 6031568, 8 pages, 2019.
View at: Publisher Site | Google Scholar
A. Karbasioun, A. R. Ashrafi, and M. V. Diudea, “Distance and detour matrices of an infinite class of dendrimer nanostars,” MATCH Communications in Mathematical and in Computer Chemistry, vol. 63, no. 1, pp. 239–246, 2010.
View at: Google Scholar
R. Wu and H. Deng, “On the detour index of a chain of C20 fullerenes,” Journal of Optoelectronic and Biomedical Materials, vol. 8, no. 2, pp. 45–48, 2016.
View at: Google Scholar
V. Kaladevi and A. Abinayaa, “On detour distance Laplacian energy,” Journal of Informatics and Mathematical Sciences, vol. 9, no. 3, pp. 721–732, 2017.
View at: Google Scholar
H. O. Abdullah and Z. I. Omar, “Edge restricted detour index of some graphs,” Journal of Discrete Mathematical Sciences and Cryptography, vol. 23, no. 4, pp. 861–877, 2020.
View at: Publisher Site | Google Scholar
A. A. Dobrynin, R. Entringer, and I. Gutman, “Wiener index of trees: theory and applications,” Acta Applicandae Mathematicae, vol. 66, no. 3, pp. 211–249, 2001.
View at: Publisher Site | Google Scholar
M. Imran, S. A. Ul Haq Bokhary, and A. Q. Baig, “On families of convex polytopes with constant metric dimension,” Computers & Mathematics with Applications, vol. 60, no. 9, pp. 2629–2638, 2010.
View at: Publisher Site | Google Scholar

Copyright

Copyright © 2021 Sakander Hayat et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

PDF Download Citation

Download other formats

Order printed copies

Views

516

Downloads

888

Citations