The Steiner Wiener index of trees with a given segment sequence

DOI10.1016/J.AMC.2018.10.007MaRDI QIDQ2008355zbMATH OpenOpenAlexFDO

Authors Jie Zhang, Hua Wang, Xiao-Dong Zhang

Publication date 25 November 2019

Published in Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2008.02019

zbMATH Keywords

treesegment sequencequasi-caterpillarSteiner \(k\)-Wiener index

Mathematics Subject Classification ID

Graphical indices (Wiener index, Zagreb index, Randi? index, etc.) (05C09) Vertex degrees (05C07) Distance in graphs (05C12)

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.

Recommendations

• Extremal trees with respect to the Steiner Wiener index
• The Steiner Wiener index of a graph
• Inverse problem on the Steiner Wiener index
• The Steiner Wiener index of trees with given diameter
• The Steiner Wiener index of trees with given bipartition

Cites work

• scientific article; zbMATH DE number 5619543 (Why is no real title available?)
• scientific article; zbMATH DE number 5627542 (Why is no real title available?)
• scientific article; zbMATH DE number 508964 (Why is no real title available?)
• scientific article; zbMATH DE number 6750302 (Why is no real title available?)
• A sharp lower bound on Steiner Wiener index for trees with given diameter
• Extremal Wiener index of trees with given number of vertices of even degree
• Greedy trees, caterpillars, and Wiener-type graph invariants
• Inverse problem on the Steiner Wiener index
• Maximum Wiener index of trees with given degree sequence
• Nordhaus-Gaddum-type results for the Steiner Wiener index of graphs
• On Steiner degree distance of trees
• On segment sequences and the Wiener index of trees
• On the average Steiner distance of graphs with presribed properties
• On the variable Wiener indices of trees with given maximum degree
• Steiner Wiener index of graph products
• Steiner degree distance
• The Steiner Wiener index of a graph
• The average Steiner distance of a graph
• The extremal values of the Wiener index of a tree with given degree sequence
• Wiener index of trees of given order and diameter at most 6
• Wiener index of trees: Theory and applications
• Wiener index on traceable and Hamiltonian graphs
• Wiener index versus maximum degree in trees

Cited in

(12)

• Extremal trees of a given degree sequence or segment sequence with respect to average Steiner 3-eccentricity
• Bounding the \(k\)-Steiner Wiener and Wiener-type indices of trees in terms of eccentric sequence
• A sharp lower bound on Steiner Wiener index for trees with given diameter
• scientific article; zbMATH DE number 7410891 (Why is no real title available?)
• scientific article; zbMATH DE number 6750302 (Why is no real title available?)
• Extremal trees of given segment sequence with respect to some eccentricity-based invariants
• On the extremal Mostar indices of trees with a given segment sequence
• Steiner Wiener index and line graphs of trees
• Extremal cover cost and reverse cover cost of trees with given segment sequence
• On segment sequences and the Wiener index of trees
• The Steiner Wiener index of trees with given bipartition
• The upper bounds on the Steiner \(k\)-Wiener index in terms of minimum and maximum degrees

This page was built for publication: The Steiner Wiener index of trees with a given segment sequence

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2008355)