IDEAS home Printed from https://ideas.repec.org/a/wly/jjmath/v2022y2022i1n7880336.html

Leap Eccentric Connectivity Index of Subdivision Graphs

Author

Listed:
  • Ali Ghalavand
  • Shiladhar Pawar
  • Nandappa D. Soner

Abstract

The second degree of a vertex in a simple graph is defined as the number of its second neighbors. The leap eccentric connectivity index of a graph M, Lξc(M), is the sum of the product of the second degree and the eccentricity of every vertex in M. In this paper, some lower and upper bounds of Lξc(S(M)) in terms of the numbers of vertices and edges, diameter, and the first Zagreb and third leap Zagreb indices are obtained. Also, the exact values of Lξc(S(M)) for some well‐known graphs are computed.

Suggested Citation

  • Ali Ghalavand & Shiladhar Pawar & Nandappa D. Soner, 2022. "Leap Eccentric Connectivity Index of Subdivision Graphs," Journal of Mathematics, John Wiley & Sons, vol. 2022(1).
    • Handle: RePEc:wly:jjmath:v:2022:y:2022:i:1:n:7880336
    DOI: 10.1155/2022/7880336
    as

    Download full text from publisher

    File URL: https://doi.org/10.1155/2022/7880336
    Download Restriction: no
    File URL: https://libkey.io/10.1155/2022/7880336?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
    ---><---

    References listed on IDEAS

    as
    1. Jia-Bao Liu & Sana Akram & Muhammad Javaid & Zhi-Ba Peng & Huseyin Isik, 2021. "Exact Values of Zagreb Indices for Generalized T-Sum Networks with Lexicographic Product," Journal of Mathematics, Hindawi, vol. 2021, pages 1-17, August.
    2. Aftab Hussain & Muhammad Numan & Nafisa Naz & Saad Ihsan Butt & Adnan Aslam & Asfand Fahad & Ahmet Sinan Cevik, 2021. "On Topological Indices for New Classes of Benes Network," Journal of Mathematics, Hindawi, vol. 2021, pages 1-7, January.
    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. Wenhu Wang & Asma Nisar & Asfand Fahad & Muhammad Imran Qureshi & Abdu Alameri, 2022. "Modified Zagreb Connection Indices for Benes Network and Related Classes," Journal of Mathematics, John Wiley & Sons, vol. 2022(1).
    2. Yun Yu & D. Antony Xavier & Eddith Sarah Varghese & Deepa Mathew & Muhammad Kamran Siddiqui & Samuel Asefa Fufa, 2022. "Distance‐Based Topological Descriptors on Ternary Hypertree Networks," Complexity, John Wiley & Sons, vol. 2022(1).

    More about this item

    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:wly:jjmath:v:2022:y:2022:i:1:n:7880336. 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: Wiley Content Delivery (email available below). General contact details of provider: https://onlinelibrary.wiley.com/journal/1469 .

    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.