ASYMPTOTIC NUMBER OF LABELED GRAPHS WITH GIVEN DEGREE SEQUENCES
ASYMPTOTIC NUMBER OF LABELED GRAPHS WITH GIVEN DEGREE SEQUENCES
复制标题
DOI：
10.1016/0097-3165(78)90059-6
复制
发表时间：
1978-01-01
影响因子：
1.1
通讯作者：
CANFIELD, ER
中科院分区：
文献类型：
--
作者：
BENDER, EA;CANFIELD, ER
本文给出了n × n对称非负整数矩阵的渐近性，并给出了如下条件：（i）每行和是指定的且有界的，（ii）元素是有界的，（iii）指定的“稀疏”元素集必须为零.这个结果可以用标号图的关联矩阵来解释。
Asymptotics are obtained for the number ofn×nsymmetric non-negative integer matrices subject to the following constraints: (i) each row sum is specified and bounded, (ii) the entries are bounded, and (iii) a specified “sparse” set of entries must be zero. The result can be interpreted in terms of incidence matrices for labeled graphs.