JOURNAL ARTICLE

Pancyclic And Hamiltonian Properties Of Dragonfly Networks.

  • Published In: Computer Journal, 2024, v. 67, n. 3. P. 1201 1 of 3

  • Database: Academic Search Ultimate 2 of 3

  • Authored By: Huo, Jin; Yang, Weihua 3 of 3

Abstract

This article focuses on the pancyclic and Hamiltonian properties of the dragonfly network \(D(n,h)\), a scalable interconnection network topology used in high-performance computing systems. It establishes that \(D(n,h)\) is Hamiltonian for \(n \geq 1, h \geq 2\), and further proves that it is pancyclic, vertex-pancyclic, and Hamiltonian-connected for \(n \geq 4, h \geq 2\). The study uses graph-theoretic methods to analyze cycles and paths within the network, demonstrating the existence of cycles of all lengths through any vertex and Hamiltonian paths between any two distinct vertices under the given conditions. These properties are significant for efficient routing, fault tolerance, and communication in dragonfly networks.

Additional Information

  • Source:Computer Journal. 2024/03, Vol. 67, Issue 3, p1201
  • Document Type:Article
  • Subject Area:Mathematics
  • Publication Date:2024
  • ISSN:0010-4620
  • DOI:10.1093/comjnl/bxad052
  • Accession Number:176726149
  • Copyright Statement:Copyright of Computer Journal is the property of Oxford University Press / USA and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Looking to go deeper into this topic? Look for more articles on EBSCOhost.