On the diameter of a class of random graphs

On the diameter of a class of random graphs

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...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on information theory 1990-03, Vol.36 (2), p.285-288
Hauptverfasser: Philips, T.K., Towsley, D.F., Wolf, J.K.
Format: Artikel
Sprache:eng
Schlagworte:
Exact sciences and technology
Magnetic recording
Mathematical methods in physics
Physics
Tree graphs
Upper bound
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.< >
ISSN:0018-9448
1557-9654
DOI:10.1109/18.52474