A Note on Connectedness of Quasi-Random Graphs
Commun. Korean Math. Soc. 1999 Vol. 14, No. 2, 295-299
ChangWoo Lee
University of Seoul
Abstract : Every quasi-random graph $G(n)$ on $n$ vertices consists of a giant component plus $o(n)$ vertices, and every quasi-random graph $G(n)$ with minimum degree $(1+o(1))\frac{n}{2}$ is connected.
Keywords : quasi-random, connected
MSC numbers : 05C80
Downloads: Full-text PDF  


Copyright © Korean Mathematical Society. All Rights Reserved.
The Korea Science Technology Center (Rm. 411), 22, Teheran-ro 7-gil, Gangnam-gu, Seoul 06130, Korea
Tel: 82-2-565-0361  | Fax: 82-2-565-0364  | E-mail: paper@kms.or.kr   | Powered by INFOrang Co., Ltd