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

Leapfrog fullerenes and Wiener index

Author

Listed:
  • Andova, Vesna
  • Orlić, Damir
  • Škrekovski, Riste

Abstract

Fullerene graphs are cubic, 3-connected planar graphs with only pentagonal and hexagonal faces. A fullerene is called a leapfrog fullerene, Le(F), if it can be constructed by a leapfrog transformation from other fullerene graph F. Here we determine the relation between the Wiener index of Le(F) and the Wiener index of the original graph F. We obtain lower and upper bounds of the Wiener index of Lei(F) in terms of the Wiener index of the original graph. As a consequence, starting with any fullerene F, and iterating the leapfrog transformation we obtain fullerenes, Lei(F), with Wiener index of order O(n2.64) and Ω(n2.36), where n is the number of vertices of Lei(F). These results disprove Hua et al. (2014) conjecture that the Wiener index of fullerene graphs on n vertices is of order Θ(n3).

Suggested Citation

  • Andova, Vesna & Orlić, Damir & Škrekovski, Riste, 2017. "Leapfrog fullerenes and Wiener index," Applied Mathematics and Computation, Elsevier, vol. 309(C), pages 281-288.
    • Handle: RePEc:eee:apmaco:v:309:y:2017:i:c:p:281-288
    DOI: 10.1016/j.amc.2017.03.043
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0096300317302278
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.amc.2017.03.043?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, Martin & Škrekovski, Riste & Tepeh, Aleksandra, 2016. "Some remarks on Wiener index of oriented graphs," Applied Mathematics and Computation, Elsevier, vol. 273(C), pages 631-636.
    2. Knor, Martin & Škrekovski, Riste & Tepeh, Aleksandra, 2015. "An inequality between the edge-Wiener index and the Wiener index of a graph," Applied Mathematics and Computation, Elsevier, vol. 269(C), pages 714-721.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Alizadeh, Yaser & Klavžar, Sandi, 2018. "On graphs whose Wiener complexity equals their order and on Wiener index of asymmetric graphs," Applied Mathematics and Computation, Elsevier, vol. 328(C), pages 113-118.
    2. Simon Brezovnik & Niko Tratnik & Petra Žigert Pleteršek, 2021. "Weighted Wiener Indices of Molecular Graphs with Application to Alkenes and Alkadienes," Mathematics, MDPI, vol. 9(2), pages 1-16, January.
    3. Hriňáková, Katarína & Knor, Martin & Škrekovski, Riste, 2019. "An inequality between variable wiener index and variable szeged index," Applied Mathematics and Computation, Elsevier, vol. 362(C), pages 1-1.
    4. Andrey A. Dobrynin & Andrei Yu Vesnin, 2019. "On the Wiener Complexity and the Wiener Index of Fullerene Graphs," Mathematics, MDPI, vol. 7(11), pages 1-17, November.

    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. Knor, Martin & Majstorović, Snježana & Škrekovski, Riste, 2018. "Graphs preserving Wiener index upon vertex removal," Applied Mathematics and Computation, Elsevier, vol. 338(C), pages 25-32.
    2. Knor, Martin & Škrekovski, Riste & Tepeh, Aleksandra, 2016. "Digraphs with large maximum Wiener index," Applied Mathematics and Computation, Elsevier, vol. 284(C), pages 260-267.
    3. Hriňáková, Katarína & Knor, Martin & Škrekovski, Riste, 2019. "An inequality between variable wiener index and variable szeged index," Applied Mathematics and Computation, Elsevier, vol. 362(C), pages 1-1.
    4. Spiro, Sam, 2022. "The Wiener index of signed graphs," Applied Mathematics and Computation, Elsevier, vol. 416(C).
    5. Č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:309:y:2017:i:c:p:281-288. 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.