On the number of \(h\)-connected graphs with a fixed diameter

DOI10.1016/S0012-365X(01)00458-7zbMATH Open1002.05035OpenAlexW1969787870MaRDI QIDQ1613507

Ioan Tomescu

Publication date: 29 August 2002

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(01)00458-7

zbMATH Keywords

diameterasymptotic enumerationeccentricityStirling's formulalabeled graphs\(h\)-connected graph

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Asymptotic enumeration (05A16)

Related Items (1)

On the number of graphs and \(h\)-hypergraphs with bounded diameter

This page was built for publication: On the number of \(h\)-connected graphs with a fixed diameter

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