Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

An asymptotic formula for the number of graphs having small diameter

From MaRDI portal
Publication:1923514
Jump to:navigation, search

DOI10.1016/0012-365X(94)00241-AzbMath0857.05047OpenAlexW2015801820MaRDI QIDQ1923514

Ioan Tomescu

Publication date: 26 February 1997

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

Full work available at URL: https://doi.org/10.1016/0012-365x(94)00241-a


zbMATH Keywords

diameternumber of graphs


Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Distance in graphs (05C12)


Related Items (1)

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



Cites Work

  • Advances in graph theory
  • The diameter of a random graph with bounded diameter
  • Unnamed Item


This page was built for publication: An asymptotic formula for the number of graphs having small diameter

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1923514&oldid=14350807"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 1 February 2024, at 15:01.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki