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

Tightness of Harary Graphs

Author

Listed:
  • Abolfazl Javan

    (Department of Algorithms and Computation, School of Engineering Sciences, College of Engineering, University of Tehran, 16 Azar, Tehran 1417614411, Iran
    These authors contributed equally to this work.)

  • Ali Moeini

    (Department of Algorithms and Computation, School of Engineering Sciences, College of Engineering, University of Tehran, 16 Azar, Tehran 1417614411, Iran
    These authors contributed equally to this work.)

  • Mohammad Shekaramiz

    (Machine Learning and Drone Laboratory, Electrical and Computer Engineering Department, Utah Valley University, Orem, UT 84058, USA)

Abstract

In the design of real-world networks, researchers evaluate various structural parameters to assess vulnerability, including connectivity, toughness, and tenacity. Recently, the tightness metric has emerged as a potentially superior vulnerability measure, although many related theorems remain unknown due to its novelty. Harary graphs, known for their maximum connectivity, are an important class of graph models for network design. Prior work has evaluated the vulnerability of three types of Harary graphs using different parameters, but the tightness metric has not been thoroughly explored. This article aims to calculate the tightness values for all three types of Harary graphs. First, it will attempt to calculate the lower bound for the value of the tightness parameter in Harary graphs using existing lemmas and theorems. Then, by presenting new lemmas and theorems, we will try to find the exact value or upper bound for this parameter in Harary graphs. For the first type of Harary graph, the tightness is precisely determined, while for the second and third types, upper bounds are provided due to structural complexity. The lemmas, theorems, and proof methods presented in this research may be used to calculate other graph and network parameters. However, the newness of the tightness parameter means that further research is needed to fully characterize its properties.

Suggested Citation

  • Abolfazl Javan & Ali Moeini & Mohammad Shekaramiz, 2024. "Tightness of Harary Graphs," Mathematics, MDPI, vol. 12(18), pages 1-12, September.
    • Handle: RePEc:gam:jmathe:v:12:y:2024:i:18:p:2894-:d:1479465
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/12/18/2894/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/12/18/2894/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Li, Yinkui & Gu, Ruijuan, 2018. "Bounds for scattering number and rupture degree of graphs with genus," Applied Mathematics and Computation, Elsevier, vol. 337(C), pages 329-334.
    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.

      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:12:y:2024:i:18:p:2894-:d:1479465. 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.