ACTA MATHEMATICA UNIVERSITATIS COMENIANAE

Vol. LXXV, 2 (2006)
p. 149 - 152
On (k,l)-radius of random graphs
M. Horvathova

Abstract.  We introduce the concept of (k, l)-radius of a graph and prove that for any fixed pair k, l the (k, l)-radius is equal to $2{k\choose 2}-{l\choose2}$ for almost all graphs. Since for k = 2 and l = 0 the (k, l)-radius is equal to the diameter, our result is a generalization of the known fact that almost all graphs have diameter two.

Keywords: random graphs, distance in graphs.

AMS Subject classification:  05C12, 05C80, 05C99.
Download:     Adobe PDF     Compressed Postscript      

Version to read:     Adobe PDF

Acta Mathematica Universitatis Comenianae
Faculty of Mathematics, Physics and Informatics
Comenius University
842 48 Bratislava, Slovak Republic  
Telephone: + 421-2-60295755 Fax: + 421-2-65425882  
e-Mail: amuc@fmph.uniba.sk   Internet: www.iam.fmph.uniba.sk/amuc

© Copyright 2006, ACTA MATHEMATICA UNIVERSITATIS COMENIANAE