Steiner 4-diameter, maximum degree and size of a graph

DOI10.5890/DNC.2021.09.015zbMath1492.05036OpenAlexW3162552413MaRDI QIDQ5087601

Chengfu Ye, He Li, Bo Zhu, Shu-Min Zhang

Publication date: 1 July 2022

Published in: The interdisciplinary journal of Discontinuity, Nonlinearity, and Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.5890/dnc.2021.09.015

zbMATH Keywords

Steiner \(k\)-diameterSteiner distance of a graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Distance in graphs (05C12) Vertex degrees (05C07)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The Steiner diameter of a graph with prescribed girth
• Upper bounds on the Steiner diameter of a graph
• The Steiner tree problem
• Steiner distance stable graphs
• On the \(k\)-diameter of \(k\)-regular \(k\)-connected graphs
• On the average Steiner distance of graphs with presribed properties
• Steiner distance and convexity in graphs
• Rainbow trees in graphs and generalized connectivity
• Distance in Graphs
• Distance-Hereditary Graphs, Steiner Trees, and Connected Domination
• A Characterization of Graphs of Diameter Two
• Steiner distance in graphs
• Steiner Distance-Hereditary Graphs
• The Steiner diameter of a graph
• Line digraph iterations and connectivity analysis of de Bruijn and Kautz graphs
• A Lower Bound for the Number of Vertices of a Graph
• Diameters in graphs
• Steiner's problem in graphs and its implications