Onk‐leaf connectivity of a random graph
作者:
Thomasz Luczak,
期刊:
Journal of Graph Theory
(WILEY Available online 1988)
卷期:
Volume 12,
issue 1
页码: 1-10
ISSN:0364-9024
年代: 1988
DOI:10.1002/jgt.3190120102
出版商: Wiley Subscription Services, Inc., A Wiley Company
数据来源: WILEY
摘要:
AbstractWe prove that, in a random graph withnvertices andN=cnlognedges, the subgraph generated by a set of all vertices of degree at leastk+ 1 isk‐leaf connected forc>1/4. A threshold function fork‐leaf connectivity is also fo
点击下载:
PDF
(366KB)
返 回