The maximum radius of graphs with given order and minimum degree
From MaRDI portal
Recommendations
- Graphs of maximum and minimum order with fixed metric dimension and diameter
- Graphs with given degree sequence and maximal spectral radius
- scientific article; zbMATH DE number 4043895
- THE DIAMETER AND RADIUS OF RADIALLY MAXIMAL GRAPHS
- The maximum size of graphs satisfying a degree condition
- The minimum degree distance of graphs of given order and size
- The maximum girth and minimum circumference of graphs with prescribed radius and diameter
- Maximum spectral radius of graphs with given connectivity, minimum degree and independence number
- Maximum size of digraphs of given radius
- Graphs with given diameter maximizing the spectral radius
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
- Minimum graphs of specified diameter, connectivity and valence. II
- Radius, diameter, and minimum degree
- The minimum order of n-connected n-regular graphs with specified diameters
- The minimum-order three-connected cubic graphs with specified diameters
Cited in
(9)- On size, radius and minimum degree
- Radius, girth and minimum degree
- Spanning trees with small diameters
- Existence of a spanning tree having small diameter
- Graphs with given degree sequence and maximal spectral radius
- The maximum valency of regular graphs with given order and odd girth
- A new bound of radius with irregularity index
- Minimum size of a graph or digraph of given radius
- The minimum degree distance of graphs of given order and size
This page was built for publication: The maximum radius of graphs with given order and minimum degree
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q658041)
