Steiner 4-diameter, maximum degree and size of a graph
From MaRDI portal
Publication:5087601
DOI10.5890/DNC.2021.09.015zbMATH Open1492.05036OpenAlexW3162552413MaRDI QIDQ5087601FDOQ5087601
Authors: He Li, Bo Zhu, Chengfu Ye, Shumin Zhang 
Publication date: 1 July 2022
Published in: The interdisciplinary journal of Discontinuity, Complexity, and Nonlinearity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.5890/dnc.2021.09.015
Cites Work
- Graph theory
- Title not available (Why is that?)
- Rainbow trees in graphs and generalized connectivity
- Title not available (Why is that?)
- The Steiner tree problem
- On the average Steiner distance of graphs with presribed properties
- Steiner distance and convexity in graphs
- Distance in graphs
- Steiner distance in graphs
- Upper bounds on the Steiner diameter of a graph
- Title not available (Why is that?)
- Title not available (Why is that?)
- Distance-Hereditary Graphs, Steiner Trees, and Connected Domination
- A Characterization of Graphs of Diameter Two
- Title not available (Why is that?)
- The Steiner diameter of a graph with prescribed girth
- Diameters in graphs
- Steiner's problem in graphs and its implications
- Title not available (Why is that?)
- On the \(k\)-diameter of \(k\)-regular \(k\)-connected graphs
- The Steiner diameter of a graph
- Title not available (Why is that?)
- Steiner Distance-Hereditary Graphs
- Title not available (Why is that?)
- Line digraph iterations and connectivity analysis of de Bruijn and Kautz graphs
- A Lower Bound for the Number of Vertices of a Graph
- Title not available (Why is that?)
- Steiner distance stable graphs
- Title not available (Why is that?)
This page was built for publication: Steiner 4-diameter, maximum degree and size of a graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5087601)
