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

On the Steiner hyper-Wiener index of a graph

Author

Listed:
  • Tratnik, Niko

Abstract

In this paper, we study the Steiner hyper-Wiener index of a graph, which is obtained from the standard hyper-Wiener index by replacing the classical graph distance with the Steiner distance. It is shown how this index is related to the Steiner Hosoya polynomial, which generalizes similar result for the standard hyper-Wiener index. Next, we show how the Steiner 3-hyper-Wiener index of a modular graph can be expressed by using the classical graph distances. As the main result, a method for computing this index for median graphs is developed. Our method makes computation of the Steiner 3-hyper-Wiener index much more efficient. Finally, the method is used to obtain the closed formulas for the Steiner 3-Wiener index and the Steiner 3-hyper-Wiener index of grid graphs.

Suggested Citation

  • Tratnik, Niko, 2018. "On the Steiner hyper-Wiener index of a graph," Applied Mathematics and Computation, Elsevier, vol. 337(C), pages 360-371.
    • Handle: RePEc:eee:apmaco:v:337:y:2018:i:c:p:360-371
    DOI: 10.1016/j.amc.2018.05.035
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0096300318304442
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.amc.2018.05.035?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. Lei, Hui & Li, Tao & Ma, Yuede & Wang, Hua, 2018. "Analyzing lattice networks through substructures," Applied Mathematics and Computation, Elsevier, vol. 329(C), pages 297-314.
    2. Gutman, Ivan, 2016. "On Steiner degree distance of trees," Applied Mathematics and Computation, Elsevier, vol. 283(C), pages 163-167.
    3. Cai, Qingqiong & Cao, Fuyuan & Li, Tao & Wang, Hua, 2018. "On distances in vertex-weighted trees," Applied Mathematics and Computation, Elsevier, vol. 333(C), pages 435-442.
    4. Č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.
    5. Lan, Yongxin & Li, Tao & Ma, Yuede & Shi, Yongtang & Wang, Hua, 2018. "Vertex-based and edge-based centroids of graphs," Applied Mathematics and Computation, Elsevier, vol. 331(C), pages 445-456.
    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. Ma, Yuede & Cao, Shujuan & Shi, Yongtang & Dehmer, Matthias & Xia, Chengyi, 2019. "Nordhaus–Gaddum type results for graph irregularities," Applied Mathematics and Computation, Elsevier, vol. 343(C), pages 268-272.
    2. Li, Shuchao & Wang, Hua & Wang, Shujing, 2019. "Some extremal ratios of the distance and subtree problems in binary trees," Applied Mathematics and Computation, Elsevier, vol. 361(C), pages 232-245.
    3. Yu, Guihai & Qu, Hui, 2018. "The coefficients of the immanantal polynomial," Applied Mathematics and Computation, Elsevier, vol. 339(C), pages 38-44.
    4. Cai, Qingqiong & Cao, Fuyuan & Li, Tao & Wang, Hua, 2018. "On distances in vertex-weighted trees," Applied Mathematics and Computation, Elsevier, vol. 333(C), pages 435-442.
    5. Li, Yinkui & Gu, Ruijuan, 2018. "Bounds for scattering number and rupture degree of graphs with genus," Applied Mathematics and Computation, Elsevier, vol. 337(C), pages 329-334.
    6. Dobrynin, Andrey A., 2019. "Infinite family of 2-connected transmission irregular graphs," Applied Mathematics and Computation, Elsevier, vol. 340(C), pages 1-4.
    7. Lan, Yongxin & Li, Tao & Wang, Hua & Xia, Chengyi, 2019. "A note on extremal trees with degree conditions," Applied Mathematics and Computation, Elsevier, vol. 341(C), pages 70-79.
    8. Sharon, Jane Olive & Rajalaxmi, T.M. & Klavžar, Sandi & Rajan, R. Sundara & Rajasingh, Indra, 2021. "Transmission in H-naphtalenic nanosheet," Applied Mathematics and Computation, Elsevier, vol. 406(C).
    9. Noureen, Sadia & Bhatti, Akhlaq Ahmad & Ali, Akbar, 2021. "Towards the solution of an extremal problem concerning the Wiener polarity index of alkanes," Chaos, Solitons & Fractals, Elsevier, vol. 144(C).
    10. Li, Fengwei & Ye, Qingfang & Broersma, Hajo & Ye, Ruixuan & Zhang, Xiaoyan, 2021. "Extremality of VDB topological indices over f–benzenoids with given order," Applied Mathematics and Computation, Elsevier, vol. 393(C).
    11. Liu, Xiaoxiao & Sun, Shiwen & Wang, Jiawei & Xia, Chengyi, 2019. "Onion structure optimizes attack robustness of interdependent networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 535(C).
    12. 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.
    13. Zhang, Jie & Wang, Hua & Zhang, Xiao-Dong, 2019. "The Steiner Wiener index of trees with a given segment sequence," Applied Mathematics and Computation, Elsevier, vol. 344, pages 20-29.
    14. 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.
    15. Li, Shuchao & Liu, Xin & Sun, Wanting & Yan, Lixia, 2023. "Extremal trees of a given degree sequence or segment sequence with respect to average Steiner 3-eccentricity," Applied Mathematics and Computation, Elsevier, vol. 438(C).
    16. Ali, Akbar & Du, Zhibin & Ali, Muhammad, 2018. "A note on chemical trees with minimum Wiener polarity index," Applied Mathematics and Computation, Elsevier, vol. 335(C), pages 231-236.
    17. Hongfang Liu & Jinxia Liang & Yuhu Liu & Kinkar Chandra Das, 2023. "A Combinatorial Approach to Study the Nordhaus–Guddum-Type Results for Steiner Degree Distance," Mathematics, MDPI, vol. 11(3), pages 1-19, February.
    18. Lan, Yongxin & Li, Tao & Ma, Yuede & Shi, Yongtang & Wang, Hua, 2018. "Vertex-based and edge-based centroids of graphs," Applied Mathematics and Computation, Elsevier, vol. 331(C), pages 445-456.
    19. Ji, Shengjin & Liu, Mengmeng & Wu, Jianliang, 2018. "A lower bound of revised Szeged index of bicyclic graphs," Applied Mathematics and Computation, Elsevier, vol. 316(C), pages 480-487.
    20. Klavžar, Sandi & Azubha Jemilet, D. & Rajasingh, Indra & Manuel, Paul & Parthiban, N., 2018. "General Transmission Lemma and Wiener complexity of triangular grids," Applied Mathematics and Computation, Elsevier, vol. 338(C), pages 115-122.

    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:337:y:2018:i:c:p:360-371. 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.