On the graphs with given diameter, number of vertices, and local diversity of balls
From MaRDI portal
Publication:3115209
Recommendations
- Diversity vectors of balls in graphs and estimates of their components
- Structure of the diversity vector of balls of a typical graph with given diameter
- scientific article; zbMATH DE number 6616703
- On the problem of characterizing the diversity vectors of balls
- Tree-like structure graphs with full diversity of balls
Cited in
(10)- scientific article; zbMATH DE number 6616703 (Why is no real title available?)
- Sufficient conditions for the existence of a graph with a given variety of balls
- Diversity vectors of balls in graphs and estimates of their components
- Conditions for the existence of a graph with given diameter, connectivity, and ball diversity vector
- Exact upper estimates of the number of different balls of a given radius in the graphs with a fixed number of vertices and a fixed diameter
- On the problem of characterizing the diversity vectors of balls
- Computing the diversity vectors of balls of a given graph
- Tree-like structure graphs with full diversity of balls
- Structure of the diversity vector of balls of a typical graph with given diameter
- A note on the localization number of random graphs: diameter two case
This page was built for publication: On the graphs with given diameter, number of vertices, and local diversity of balls
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3115209)
