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

Remarks on the Graovac–Ghorbani index of bipartite graphs

Author

Listed:
  • Dimitrov, Darko
  • Ikica, Barbara
  • Škrekovski, Riste

Abstract

The atom–bond connectivity (ABC) index is a well-known degree-based molecular structure descriptor with a variety of chemical applications. In 2010 Graovac and Ghorbani introduced a distance-based analog of this index, the Graovac–Ghorbani (GG) index, which yielded promising results when compared to analogous descriptors. In this paper, we investigate the structure of graphs that maximize and minimize the GG index. Specifically, we show that amongst all bipartite graphs, the minimum GG index is attained by a complete bipartite graph, while the maximum GG index is attained by a path or a cycle-like graph; the structure of the resulting graph depends on the number of vertices. Through the course of the research, we also derive an asymptotic estimate of the GG index of paths. In order to obtain our results, we introduce a normalized version of the GG index and call it the normalized Graovac–Ghorbani (NGG) index. Finally, we discuss some related open questions as a potential extension of our work.

Suggested Citation

  • Dimitrov, Darko & Ikica, Barbara & Škrekovski, Riste, 2017. "Remarks on the Graovac–Ghorbani index of bipartite graphs," Applied Mathematics and Computation, Elsevier, vol. 293(C), pages 370-376.
    • Handle: RePEc:eee:apmaco:v:293:y:2017:i:c:p:370-376
    DOI: 10.1016/j.amc.2016.08.047
    as

    Download full text from publisher

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

    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:293:y:2017:i:c:p:370-376. 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.

    We have no bibliographic references for this item. You can help adding them by using 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.