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

MaRDI QIDQ3115205zbMATH OpenFDO

Authors T. I. Fedoryaeva

Publication date 20 February 2012

zbMATH Keywords

graphestimatediameter of a graphmetric ballnumber of ballsradius of a ball

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Distance in graphs (05C12)

Recommendations

• Diversity vectors of balls in graphs and estimates of their components
• Majorants and minorants for the classes of graphs with fixed diameter and number of vertices
• scientific article; zbMATH DE number 749225
• On radius and typical properties of \(n\)-vertex graphs of given diameter
• On the graphs with given diameter, number of vertices, and local diversity of balls

Cited in

(2)

• Tree-like structure graphs with full diversity of balls
• Majorants and minorants for the classes of graphs with fixed diameter and number of vertices

This page was built for publication: 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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3115205)