Graphs status unique in connected graphs
From MaRDI portal
Cites work
- Bounds on the radius and status of graphs
- Branch-weight unique trees
- Constructing status injective graphs
- Counterexamples to randić's conjecture on distance degree sequences for trees
- Distance in graphs
- scientific article; zbMATH DE number 194437 (Why is no real title available?)
- scientific article; zbMATH DE number 2230268 (Why is no real title available?)
- Maximum variances and minimum statuses of connected weighted-graphs
- Minimum status of series-reduced trees with given parameters
- Minimum status of trees with a given degree sequence
- Minimum status of trees with given parameters
- Minimum statuses of connected graphs with fixed maximum degree and order
- On constructing graphs with the same status sequence.
- On the status sequences of trees
- Pairs of a tree and a nontree graph with the same status sequence
- Proximity and remoteness in graphs: results and conjectures
- Spiders are status unique in trees
- Statuses and branch-weights of weighted trees
- Weakly status injective trees are status unique in trees.
- Which numbers are status differences?
This page was built for publication: Graphs status unique in connected graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7411224)