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

Research output: Contribution to journal › Article › peer-review

Original language	English
Pages (from-to)	204-214
Number of pages	11
Journal	Journal of Applied and Industrial Mathematics
Volume	11
Issue number	2
DOIs	https://doi.org/10.1134/S1990478917020065
Publication status	Published - 1 Apr 2017

graph, graph diameter, labeled graph, number of graphs, ordinary graph, shortest path

ID: 10043193