IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v13y2025i9p1532-d1650492.html
   My bibliography  Save this article

Structure Fault Tolerance of Fully Connected Cubic Networks

Author

Listed:
  • Eminjan Sabir

    (College of Mathematics and System Sciences, Xinjiang University, Urumqi 830046, China
    These authors contributed equally to this work.)

  • Cheng-Kuan Lin

    (Department of Computer Science, National Yang Ming Chiao Tung University, Hsinchu 30010, Taiwan
    These authors contributed equally to this work.)

Abstract

An interconnection network is usually modeled by a graph, and fault tolerance of the interconnection network is often measured by connectivity of the graph. Given a connected subgraph L of a graph G and non-negative integer t , the t -extra connectivity κ t ( G ) , the L -structure connectivity κ ( G ; L ) and the t -extra L -structure connectivity κ g ( G ; L ) of G can provide new metrics to measure the fault tolerance of a network represented by G . Fully connected cubic networks FC n are a class of hierarchical networks which enjoy the strengths of a constant vertex degree and good expansibility. In this paper, we determine κ t ( FC n ) , κ ( FC n ; L ) and κ t ( FC n ; L ) for t = 1 and L ∈ { K 1 , 1 , K 1 , 2 , K 1 , 3 } . We also establish the edge versions λ t ( FC n ) , λ ( FC n ; L ) and λ t ( FC n ; L ) for t = 1 and L ∈ { K 1 , 1 , K 1 , 2 } .

Suggested Citation

  • Eminjan Sabir & Cheng-Kuan Lin, 2025. "Structure Fault Tolerance of Fully Connected Cubic Networks," Mathematics, MDPI, vol. 13(9), pages 1-13, May.
    • Handle: RePEc:gam:jmathe:v:13:y:2025:i:9:p:1532-:d:1650492
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/13/9/1532/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/13/9/1532/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Yongsheng Rao & Saeed Kosari & Janakiraman Anitha & Indra Rajasingh & Hossein Rashmanlou, 2022. "Forcing Parameters in Fully Connected Cubic Networks," Mathematics, MDPI, vol. 10(8), pages 1-11, April.
    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.

      More about this item

      Keywords

      ;
      ;
      ;
      ;
      ;

      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:gam:jmathe:v:13:y:2025:i:9:p:1532-:d:1650492. 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: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.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.