IDEAS home Printed from https://ideas.repec.org/a/hin/complx/6684784.html
   My bibliography  Save this article

Hamilton Connectivity of Convex Polytopes with Applications to Their Detour Index

Author

Listed:
  • Sakander Hayat
  • Asad Khan
  • Suliman Khan
  • Jia-Bao Liu
  • M. Irfan Uddin

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.

Suggested Citation

  • Sakander Hayat & Asad Khan & Suliman Khan & Jia-Bao Liu & M. Irfan Uddin, 2021. "Hamilton Connectivity of Convex Polytopes with Applications to Their Detour Index," Complexity, Hindawi, vol. 2021, pages 1-23, January.
    • Handle: RePEc:hin:complx:6684784
    DOI: 10.1155/2021/6684784
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/complexity/2021/6684784.pdf
    Download Restriction: no
    File URL: http://downloads.hindawi.com/journals/complexity/2021/6684784.xml
    Download Restriction: no
    File URL: https://libkey.io/10.1155/2021/6684784?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:hin:complx:6684784. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.