Nordhaus-Gaddum-type results for the Steiner Wiener index of graphs
From MaRDI portal
Publication:505439
DOI10.1016/j.dam.2016.11.014zbMath1354.05041OpenAlexW2563289603MaRDI QIDQ505439
Yaping Mao, Zhao Wang, He Li, Ivan Gutman
Publication date: 23 January 2017
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2016.11.014
Applications of graph theory (05C90) Distance in graphs (05C12) Connectivity (05C40) Vertex degrees (05C07)
Related Items (10)
The upper bounds on the Steiner \(k\)-Wiener index in terms of minimum and maximum degrees ⋮ Unnamed Item ⋮ The Steiner Wiener index of trees with a given segment sequence ⋮ The Steiner \(k\)-Wiener index of graphs with given minimum degree ⋮ Steiner diameter, maximum degree and size of a graph ⋮ Extremal trees with respect to the Steiner Wiener index ⋮ Nordhaus-Gaddum Type results for the Harary index of graphs ⋮ On the relation between Wiener index and eccentricity of a graph ⋮ On the Steiner hyper-Wiener index of a graph ⋮ A note on Steiner reciprocal degree distance
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The Steiner Wiener index of a graph
- On Wiener and multiplicative Wiener indices of graphs
- Upper bounds on the Steiner diameter of a graph
- Some remarks on Wiener index of oriented graphs
- A graph and its complement with specified properties. I: Connectivity
- On the average Steiner distance of graphs with presribed properties
- A survey of Nordhaus-Gaddum type relations
- Steiner distance and convexity in graphs
- Distance in Graphs
- Steiner distance in graphs
- The Steiner diameter of a graph
- The average Steiner distance of a graph
- Minimizing Wiener Index for Vertex-Weighted Trees with Given Weight and Degree Sequences
- Steiner centers in graphs
- Wiener index of trees: Theory and applications
This page was built for publication: Nordhaus-Gaddum-type results for the Steiner Wiener index of graphs
