The Steiner Wiener index of trees with a given segment sequence

DOI10.1016/J.AMC.2018.10.007zbMATH Open1428.05074arXiv2008.02019OpenAlexW2898225007MaRDI QIDQ2008355FDOQ2008355

Jie Zhang, Hua Wang, Xiao-Dong Zhang

Publication date: 25 November 2019

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

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.

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

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

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)

Cites Work

• Wiener index versus maximum degree in trees
• Wiener index of trees: Theory and applications
• On the average Steiner distance of graphs with presribed properties
• The Steiner Wiener index of a graph
• The average Steiner distance of a graph
• Title not available (Why is that?)
• Greedy trees, caterpillars, and Wiener-type graph invariants
• Title not available (Why is that?)
• 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
• Title not available (Why is that?)
• Title not available (Why is that?)
• The Maximum Wiener Index of Trees with Given Degree Sequences
• Nordhaus-Gaddum-type results for the Steiner Wiener index of graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• On the variable Wiener indices of trees with given maximum degree
• Inverse problem on the Steiner Wiener index
• On Steiner degree distance of trees
• WIENER INDEX ON TRACEABLE AND HAMILTONIAN GRAPHS
• A sharp lower bound on Steiner Wiener index for trees with given diameter
• Title not available (Why is that?)

Cited In (8)

• Extremal cover cost and reverse cover cost of trees with given segment sequence
• Title not available (Why is that?)
• On the extremal Mostar indices of trees with a given segment sequence
• Title not available (Why is that?)
• The upper bounds on the Steiner \(k\)-Wiener index in terms of minimum and maximum degrees
• Title not available (Why is that?)
• Extremal trees of given segment sequence with respect to some eccentricity-based invariants
• Extremal trees of a given degree sequence or segment sequence with respect to average Steiner 3-eccentricity

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)