The upper bounds on the Steiner \(k\)-Wiener index in terms of minimum and maximum degrees

DOI10.1007/s10878-022-00887-6zbMath1497.05048OpenAlexW4286491644WikidataQ114225852 ScholiaQ114225852MaRDI QIDQ2165277

Wanping Zhang, Baoyindureng Wu, Ji Xiang Meng

Publication date: 19 August 2022

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-022-00887-6

zbMATH Keywords

packinggirthminimum degreemaximum degreeSteiner \(k\)-Wiener indexaverage Steiner \(k\)-distance

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10) Vertex degrees (05C07) Graphical indices (Wiener index, Zagreb index, Randi? index, etc.) (05C09) Chemical graph theory (05C92)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The Steiner Wiener index of a graph
• Upper bounds on the Steiner diameter of a graph
• Nordhaus-Gaddum-type results for the Steiner Wiener index of graphs
• Wiener index of Eulerian graphs
• Mean distance in a graph
• Radius, diameter, and minimum degree
• A sharp lower bound on Steiner Wiener index for trees with given diameter
• The Steiner Wiener index of trees with a given segment sequence
• The Steiner \(k\)-Wiener index of graphs with given minimum degree
• On the sum of all distances in a graph or digraph
• Distance in graphs
• Steiner distance in graphs
• The average Steiner distance of a graph
• Average distance, minimum degree, and spanning trees
• Wiener index, Harary index and Hamiltonicity of graphs
• Wiener index of trees: Theory and applications

This page was built for publication: The upper bounds on the Steiner \(k\)-Wiener index in terms of minimum and maximum degrees