期刊
JOURNAL OF COMBINATORIAL THEORY SERIES A
卷 101, 期 2, 页码 249-263出版社
ACADEMIC PRESS INC ELSEVIER SCIENCE
DOI: 10.1016/S0097-3165(02)00017-1
关键词
-
类别
We derive an asymptotic formula for the number of graphs with n vertices all of degree at least k, and m edges, with k fixed. This is done by summing the asymptotic formula for the number of graphs with a given degree sequence, all degrees at least k. This approach requires analysis of a set of independent truncated Poisson variables, which approximate the degree sequence of a random graph chosen uniformly at random among all graphs with n vertices, m edges, and a minimum degree at least k. Our main result generalizes a result of Bender, Canfield and McKay and of Korshunov, who treated the case k = 1 using different methods. (C) 2003 Elsevier Science (USA). All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据