The Steiner Wiener index of trees with a given segment sequence

Jie Zhang, Hua Wang and Xiao-Dong Zhang

Applied Mathematics and Computation, 2019, vol. 344-345, 20-29

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.

Keywords: Steiner k-Wiener index; Segment sequence; Tree; Quasi-caterpillar (search for similar items in EconPapers)
Date: 2019
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300318308671
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:344-345:y:2019:i::p:20-29

DOI: 10.1016/j.amc.2018.10.007

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().