Asymptotic approximation for the number of n-vertex graphs of given diameter

DOI10.1134/S1990478917020065zbMath1399.05108OpenAlexW2617490678MaRDI QIDQ5373998

Tatiana Ivanovna Fedoryaeva

Publication date: 6 April 2018

Published in: Journal of Applied and Industrial Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s1990478917020065

zbMATH Keywords

shortest pathlabeled graphgraph diameternumber of graphsordinary graph

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Paths and cycles (05C38) Distance in graphs (05C12) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Cites Work

• An asymptotic formula for the number of graphs having small diameter
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Asymptotic approximation for the number of n-vertex graphs of given diameter