- Current Issue - Ahead of Print Articles - All Issues - Search - Open Access - Information for Authors - Downloads - Guideline - Regulations ㆍPaper Submission ㆍPaper Reviewing ㆍPublication and Distribution - Code of Ethics - For Authors ㆍOnline Submission ㆍMy Manuscript - For Reviewers - For Editors
 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