The maximum radius of graphs with given order and minimum degree
From MaRDI portal
Publication:658041
DOI10.1016/j.disc.2011.08.023zbMath1238.05073OpenAlexW2094759041MaRDI QIDQ658041
Woonjae Hwang, Yoomi Rho, Byung Chul Song, Byeong Moon Kim
Publication date: 11 January 2012
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2011.08.023
Related Items
A new bound of radius with irregularity index ⋮ Radius, girth and minimum degree ⋮ Existence of a spanning tree having small diameter ⋮ Spanning trees with small diameters
Cites Work
- Classification and enumeration of minimum (d, 3, 3)-graphs for odd d
- Classification and enumeration of minimum (d,1,3)-graphs and minimum (d,2,3)-graphs
- Radius, diameter, and minimum degree
- Minimum graphs of specified diameter, connectivity and valence. II
- The minimum order of n-connected n-regular graphs with specified diameters
- The minimum-order three-connected cubic graphs with specified diameters
This page was built for publication: The maximum radius of graphs with given order and minimum degree