ON THE DIAMETER OF A CLASS OF RANDOM GRAPHS

被引：6

作者：

PHILIPS, TK

TOWSLEY, DF

WOLF, JK

机构：

[1] UNIV MASSACHUSETTS,DEPT COMP & INFORMAT SCI,AMHERST,MA 01003

[2] UNIV CALIF SAN DIEGO,CTR MAGNET RECORDING RES,LA JOLLA,CA 92093

来源：

IEEE TRANSACTIONS ON INFORMATION THEORY | 1990年 / 36卷 / 02期

基金：

美国国家科学基金会;

关键词：

D O I：

10.1109/18.52474

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

The diameter of a class of random directed graphs in which the outdegree of each vertex is constrained to be exactly k is examined. Vertices connect themselves to k other distinct vertices with outwardly directed edges, all possible sets of k vertices being chosen with equal probability. It is shown that the diameter of such a random graph almost surely takes on only one of two values. © 1990 IEEE

引用

页码：285 / 288

页数：4

共 5 条

[1] THE DIAMETER OF RANDOM GRAPHS [J].