Chidanand Apté, Fred Damerau, et al.
ACM Transactions on Information Systems (TOIS)
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
Chidanand Apté, Fred Damerau, et al.
ACM Transactions on Information Systems (TOIS)
Elliot Linzer, M. Vetterli
Computing
Ehud Altman, Kenneth R. Brown, et al.
PRX Quantum
Raghu Krishnapuram, Krishna Kummamuru
IFSA 2003