THE DIAMETER OF A RANDOM GRAPH WITH BOUNDED DIAMETER

Authors
GRABLE DA
Citation
Da. Grable, THE DIAMETER OF A RANDOM GRAPH WITH BOUNDED DIAMETER, Random structures & algorithms, 6(2-3), 1995, pp. 193-199
Citations number
3
Categorie Soggetti
Mathematics,Mathematics,Mathematics,"Computer Science Software Graphycs Programming
Journal title
Random structures & algorithms → ACNP
ISSN journal
10429832
Volume
6
Issue
2-3
Year of publication
1995
Pages
193 - 199
Database
ISI
SICI code
1042-9832(1995)6:2-3<193:TDOARG>2.0.ZU;2-O
Abstract
We prove a conjecture of Tomescu from the Random Graphs '87 Problem Se ssion. For k greater than or equal to 2, almost every graph with diame ter at least k has diameter exactly k. (C) 1995 John Wiley & Sons, Inc .