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

On the minimum value of sum-Balaban index

Author

Listed:
  • Knor, Martin
  • Kranjc, Jaka
  • Škrekovski, Riste
  • Tepeh, Aleksandra

Abstract

We consider extremal values of sum-Balaban index among graphs on n vertices. We determine that the upper bound for the minimum value of the sum-Balaban index is at most 4.47934 when n goes to infinity. For small values of n we determine the extremal graphs and we observe that they are similar to dumbbell graphs, in most cases having one extra edge added to the corresponding extreme for the usual Balaban index. We show that in the class of balanced dumbbell graphs, those with clique sizes 2log(1+2)4n+o(n) have asymptotically the smallest value of sum-Balaban index. We pose several conjectures and problems regarding this topic.

Suggested Citation

  • Knor, Martin & Kranjc, Jaka & Škrekovski, Riste & Tepeh, Aleksandra, 2017. "On the minimum value of sum-Balaban index," Applied Mathematics and Computation, Elsevier, vol. 303(C), pages 203-210.
    • Handle: RePEc:eee:apmaco:v:303:y:2017:i:c:p:203-210
    DOI: 10.1016/j.amc.2017.01.041
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0096300317300553
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.amc.2017.01.041?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. Knor, M. & Kranjc, J. & Škrekovski, Riste & Tepeh, Aleksandra, 2016. "A search for the minimum value of Balaban index," Applied Mathematics and Computation, Elsevier, vol. 286(C), pages 301-310.
    2. Lei, Hui & Yang, Hua, 2015. "Bounds for the Sum-Balaban index and (revised) Szeged index of regular graphs," Applied Mathematics and Computation, Elsevier, vol. 268(C), pages 1259-1266.
    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. Wang, Shujing, 2017. "On extremal cacti with respect to the Szeged index," Applied Mathematics and Computation, Elsevier, vol. 309(C), pages 85-92.
    2. Ji, Shengjin & Liu, Mengmeng & Wu, Jianliang, 2018. "A lower bound of revised Szeged index of bicyclic graphs," Applied Mathematics and Computation, Elsevier, vol. 316(C), pages 480-487.
    3. Črepnjak, Matevž & Tratnik, Niko, 2017. "The Szeged index and the Wiener index of partial cubes with applications to chemical graphs," Applied Mathematics and Computation, Elsevier, vol. 309(C), pages 324-333.

    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:303:y:2017:i:c:p:203-210. 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.