IDEAS home Printed from https://ideas.repec.org/a/eee/apmaco/v490y2025ics0096300324006581.html
   My bibliography  Save this article

2-Edge Hamiltonian connectedness: Characterization and results in data center networks

Author

Listed:
  • Wang, Mei-Li
  • Hao, Rong-Xia
  • Chang, Jou-Ming
  • Bang, Sejeong

Abstract

A graph G is 2-edge Hamiltonian connected if for any edge set E⊆{uv:u,v∈V(G),u≠v} with |E|≤2, G∪E has a Hamiltonian cycle containing all edges of E, where G∪E is the graph obtained from G by including all edges of E. The problem of determining whether a graph is 2-edge Hamiltonian connected is challenging, as it is known to be NP-complete. This property is stronger than Hamiltonian connectedness, which indicates the existence of a Hamiltonian path between every pair of vertices in a graph. This paper first provides a characterization and a sufficiency for 2-edge Hamiltonian connectedness. Through this, we shed light on the fact that many well-known networks are 2-edge Hamiltonian connected, including BCube data center networks and some variations of hypercubes, and so on. Additionally, we demonstrate that DCell data center networks and Cartesian product graphs containing almost all generalized hypercubes are 2-edge Hamiltonian connected.

Suggested Citation

  • Wang, Mei-Li & Hao, Rong-Xia & Chang, Jou-Ming & Bang, Sejeong, 2025. "2-Edge Hamiltonian connectedness: Characterization and results in data center networks," Applied Mathematics and Computation, Elsevier, vol. 490(C).
    • Handle: RePEc:eee:apmaco:v:490:y:2025:i:c:s0096300324006581
    DOI: 10.1016/j.amc.2024.129197
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0096300324006581
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.amc.2024.129197?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Qin, Xiao-Wen & Chang, Jou-Ming & Hao, Rong-Xia, 2019. "Constructing dual-CISTs of DCell data center networks," Applied Mathematics and Computation, Elsevier, vol. 362(C), pages 1-1.
    2. Liu, Xuemei & Meng, Jixiang, 2021. "The k-restricted edge-connectivity of the data center network DCell," Applied Mathematics and Computation, Elsevier, vol. 396(C).
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Hao, Rong-Xia & Qin, Xiao-Wen & Zhang, Hui & Chang, Jou-Ming, 2024. "Two-disjoint-cycle-cover pancyclicity of data center networks," Applied Mathematics and Computation, Elsevier, vol. 475(C).
    2. Yang, Jinn-Shyong & Li, Xiao-Yan & Peng, Sheng-Lung & Chang, Jou-Ming, 2022. "Parallel construction of multiple independent spanning trees on highly scalable datacenter networks," Applied Mathematics and Computation, Elsevier, vol. 413(C).
    3. Qin, Xiao-Wen & Hao, Rong-Xia, 2021. "Reliability analysis based on the dual-CIST in shuffle-cubes," Applied Mathematics and Computation, Elsevier, vol. 397(C).
    4. Chen, Meirun & Habib, Michel & Lin, Cheng-Kuan, 2024. "A novel edge connectivity based on edge partition for hypercube and folded hypercube," Applied Mathematics and Computation, Elsevier, vol. 470(C).
    5. Wang, Yihong & Meng, Jixiang & Fan, Jianxi, 2023. "Reliabilities for two kinds of graphs with smaller diameters," Applied Mathematics and Computation, Elsevier, vol. 446(C).
    6. Liu, Xuemei & Meng, Jixiang & Sabir, Eminjan, 2023. "Component connectivity of the data center network DCell," Applied Mathematics and Computation, Elsevier, vol. 444(C).
    7. Yu-Han Chen & Kung-Jui Pai & Hsin-Jung Lin & Jou-Ming Chang, 2022. "Constructing tri-CISTs in shuffle-cubes," Journal of Combinatorial Optimization, Springer, vol. 44(5), pages 3194-3211, December.

    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:eee:apmaco:v:490:y:2025:i:c:s0096300324006581. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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: Catherine Liu (email available below). General contact details of provider: https://www.journals.elsevier.com/applied-mathematics-and-computation .

    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.