Steiner diameter, maximum degree and size of a graph

DOI10.1016/j.disc.2021.112468zbMath1466.05057arXiv1703.04974MaRDI QIDQ2032893

Zhao Wang, Peter Dankelmann, Yaping Mao

Publication date: 14 June 2021

Published in: Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

diameter; size; maximum degree; Steiner distance; Steiner diameter

Mathematics Subject Classification ID

05C35: Extremal problems in graph theory

05C12: Distance in graphs

05C40: Connectivity

05C07: Vertex degrees

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The Steiner Wiener index of a graph
• The Steiner diameter of a graph with prescribed girth
• Upper bounds on the Steiner diameter of a graph
• Steiner diameter of 3, 4 and 5-connected maximal planar graphs
• Nordhaus-Gaddum-type results for the Steiner Wiener index of graphs
• The Steiner tree problem
• Intersecting designs from linear programming and graphs of diameter two
• Steiner distance stable graphs
• On the average Steiner distance of graphs with presribed properties
• A sharp lower bound on Steiner Wiener index for trees with given diameter
• Inverse problem on the Steiner Wiener index
• The Steiner \(k\)-Wiener index of graphs with given minimum degree
• Steiner distance and convexity in graphs
• Graphs of diameter 3 with the minimum number of edges
• Rainbow trees in graphs and generalized connectivity
• Steiner distance in graphs
• Steiner Distance-Hereditary Graphs
• Steiner Distance in Product Networks
• The Steiner diameter of a graph
• From steiner centers to steiner medians
• The average Steiner distance of a graph
• On the existence of N‐connected graphs with prescribed degrees (n ≧ 2)
• Steiner centers in graphs