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

Leap eccentric connectivity index in graphs with universal vertices

Author

Listed:
  • Ghalavand, Ali
  • Klavžar, Sandi
  • Tavakoli, Mostafa
  • Hakimi-Nezhaad, Mardjan
  • Rahbarnia, Freydoon

Abstract

For a graph X, the leap eccentric connectivity index (LECI) is ∑x∈V(X)d2(x,X)ε(x,X), where d2(x,X) is the 2-distance degree and ε(x,X) the eccentricity of x. We establish a lower and an upper bound for the LECI of X in terms of its order and the number of universal vertices, and identify the extremal graphs. We prove an upper bound on the index for trees of a given order and diameter, and determine the extremal trees. We also determine trees with maximum LECI among all trees of a given order.

Suggested Citation

  • Ghalavand, Ali & Klavžar, Sandi & Tavakoli, Mostafa & Hakimi-Nezhaad, Mardjan & Rahbarnia, Freydoon, 2023. "Leap eccentric connectivity index in graphs with universal vertices," Applied Mathematics and Computation, Elsevier, vol. 436(C).
    • Handle: RePEc:eee:apmaco:v:436:y:2023:i:c:s0096300322005938
    DOI: 10.1016/j.amc.2022.127519
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0096300322005938
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.amc.2022.127519?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:436:y:2023:i:c:s0096300322005938. 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.