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

Explicit relation between the Wiener index and the edge-Wiener index of the catacondensed hexagonal systems

Author

Listed:
  • Chen, Ailian
  • Xiong, Xianzhu
  • Lin, Fenggen

Abstract

The Wiener index W(G) and the edge-Wiener index We(G) of a graph G are defined as the sum of all distances between pairs of vertices in a graph G and the sum of all distances between pairs of edges in G, respectively. The Wiener index, due to its correlation with a large number of physico-chemical properties of organic molecules and its interesting and non-trivial mathematical properties, has been extensively studied in both theoretical and chemical literature. The edge-Wiener index of G is nothing but the Wiener index of the line graph of G. The concept of line graph has been found various applications in chemical research. In this paper, we show that if G is a catacondensed hexagonal system with h hexagons and has t linear segments S1,S2,…,St of lengths l(Si)=li(1≤i≤t), then We(G)=2516W(G)+116(120h2+94h+29)−14∑i=1t(li−1)2. Our main result reduces the problems on the edge-Wiener index to those on the Wiener index in the catacondensed hexagonal systems, which makes the former ones easier.

Suggested Citation

  • Chen, Ailian & Xiong, Xianzhu & Lin, Fenggen, 2016. "Explicit relation between the Wiener index and the edge-Wiener index of the catacondensed hexagonal systems," Applied Mathematics and Computation, Elsevier, vol. 273(C), pages 1100-1106.
    • Handle: RePEc:eee:apmaco:v:273:y:2016:i:c:p:1100-1106
    DOI: 10.1016/j.amc.2015.10.063
    as

    Download full text from publisher

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

    Citations

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


    Cited by:

    1. Chen, Ailian & Xiong, Xianzhu & Lin, Fenggen, 2016. "Distance-based topological indices of the tree-like polyphenyl systems," Applied Mathematics and Computation, Elsevier, vol. 281(C), pages 233-242.
    2. Wu, Xiaoxia & Zhang, Lianzhu & Chen, Haiyan, 2017. "Spanning trees and recurrent configurations of a graph," Applied Mathematics and Computation, Elsevier, vol. 314(C), pages 25-30.

    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:273:y:2016:i:c:p:1100-1106. 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.