Minimum statuses of connected graphs with fixed maximum degree and order
From MaRDI portal
Publication:1928529
Recommendations
Cites work
- An Algorithmic Approach to Network Location Problems. II: Thep-Medians
- scientific article; zbMATH DE number 3172309 (Why is no real title available?)
- scientific article; zbMATH DE number 194437 (Why is no real title available?)
- scientific article; zbMATH DE number 3328106 (Why is no real title available?)
- Some properties of a centroid of a free tree
Cited in
(13)- Minimum status of series-reduced trees with given parameters
- On the difference between proximity and other distance parameters in triangle-free graphs and \(C_4\)-free graphs
- On the status sequences of trees
- Which numbers are status differences?
- Statuses and double branch weights of quadrangular outerplanar graphs
- Minimally \((n,\lambda)\)-connected graphs of low order and maximal size
- Minimum status of trees with a given degree sequence
- Minimum order graphs with specified diameter, connectivity, and regularity
- Maximum variances and minimum statuses of connected weighted-graphs
- Minimum status of trees with given parameters
- Minimum and maximum resistance status of unicyclic graphs
- Proximity, remoteness and maximum degree in graphs
- On proximity and other distance parameters in planar graphs
This page was built for publication: Minimum statuses of connected graphs with fixed maximum degree and order
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1928529)