IDEAS home Printed from https://ideas.repec.org/a/eee/apmaco/v344-345y2019ip20-29.html
   My bibliography  Save this article

The Steiner Wiener index of trees with a given segment sequence

Author

Listed:
  • Zhang, Jie
  • Wang, Hua
  • Zhang, Xiao-Dong

Abstract

The Steiner distance of vertices in a set S is the minimum size of a connected subgraph that contain these vertices. The sum of the Steiner distances over all sets S of cardinality k is called the Steiner k-Wiener index and studied as the natural generalization of the famous Wiener index in chemical graph theory. In this paper we study the extremal structures, among trees with a given segment sequence, that maximize or minimize the Steiner k-Wiener index. The same extremal problems are also considered for trees with a given number of segments.

Suggested Citation

  • 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.
    • Handle: RePEc:eee:apmaco:v:344-345:y:2019:i::p:20-29
    DOI: 10.1016/j.amc.2018.10.007
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0096300318308671
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.amc.2018.10.007?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. Gutman, Ivan, 2016. "On Steiner degree distance of trees," Applied Mathematics and Computation, Elsevier, vol. 283(C), pages 163-167.
    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. 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).
    2. Wanping Zhang & Jixiang Meng & Baoyindureng Wu, 2022. "The upper bounds on the Steiner k-Wiener index in terms of minimum and maximum degrees," Journal of Combinatorial Optimization, Springer, vol. 44(2), pages 1199-1220, September.
    3. Al-Yakoob, Salem & Stevanović, Dragan, 2020. "On transmission irregular starlike trees," Applied Mathematics and Computation, Elsevier, vol. 380(C).

    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. 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).
    2. 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.
    3. 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.
    4. Tratnik, Niko, 2018. "On the Steiner hyper-Wiener index of a graph," Applied Mathematics and Computation, Elsevier, vol. 337(C), pages 360-371.

    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:344-345:y:2019:i::p:20-29. 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.