Minimum status of trees with a given degree sequence
From MaRDI portal
Publication:2687032
Recommendations
Cites work
- Computer science -- theory and applications. 15th international computer science symposium in Russia, CSR 2020, Yekaterinburg, Russia, June 29 -- July 3, 2020. Proceedings
- Graphs with given degree sequence and maximal spectral radius
- scientific article; zbMATH DE number 5627542 (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?)
- Minimum status of trees with given parameters
- Minimum statuses of connected graphs with fixed maximum degree and order
- Network descriptors based on betweenness centrality and transmission and their extremal values
- Nordhaus-Gaddum relations for proximity and remoteness in graphs
- Proximity and average eccentricity of a graph
- Proximity and remoteness in directed and undirected graphs
- Proximity and remoteness in graphs: results and conjectures
- Proximity, remoteness and girth in graphs
- Proximity, remoteness and minimum degree
- Remoteness, proximity and few other distance invariants in graphs
- Some properties of a centroid of a free tree
- The extremal values of the Wiener index of a tree with given degree sequence
- Which numbers are status differences?
Cited in
(6)- Minimum degree and minimum number of edge-disjoint trees
- Minimum statuses of connected graphs with fixed maximum degree and order
- Minimum status of series-reduced trees with given parameters
- Minimum-Entropy Tree Structures with a Given Terminal Node Assignment
- Minimum status of trees with given parameters
- Proximity and radius in outerplanar graphs with bounded faces
This page was built for publication: Minimum status of trees with a given degree sequence
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2687032)