Minimum degree, edge-connectivity and radius
From MaRDI portal
Publication:385477
Recommendations
Cites work
- scientific article; zbMATH DE number 3497930 (Why is no real title available?)
- scientific article; zbMATH DE number 1135688 (Why is no real title available?)
- scientific article; zbMATH DE number 2188620 (Why is no real title available?)
- scientific article; zbMATH DE number 3355058 (Why is no real title available?)
- A characterization of radius-critical graphs
- An upper bound on the radius of a 3-edge-connected graph
- Diameter of 4-colourable graphs
- Domination, radius, and minimum degree
- Mean distance and minimum degree
- Minimum size of a graph or digraph of given radius
- Radius, diameter, and minimum degree
- Using minimum degree to bound average distance
Cited in
(13)- Embeddings into almost self-centered graphs of given radius
- Radius, girth and minimum degree
- Comparative results and bounds for the eccentric-adjacency index
- On maximum Wiener index of trees and graphs with given radius
- Relations between degree-based graph invariants
- An upper bound on the radius of a 3-edge-connected graph
- scientific article; zbMATH DE number 2197917 (Why is no real title available?)
- The connective eccentricity index and modified second Zagreb index of Parikh word representable graphs
- \((s,m)\)-radius of \(k\)-connected graphs
- scientific article; zbMATH DE number 6386250 (Why is no real title available?)
- scientific article; zbMATH DE number 866662 (Why is no real title available?)
- Minimum size of a graph or digraph of given radius
- Radius, leaf number, connected domination number and minimum degree
This page was built for publication: Minimum degree, edge-connectivity and radius
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q385477)