Two Models for Random Graphs with Bounded Degree

Two digraphs both of whose nodes consist of the set of unlabeled graphs of order n having bounded vertex degree equal to f are studied. Adjacency in these digraphs is defined via one-edge transformations of the node graphs. Probabilities on the arcs are introduced so that one digraph is a strictly e...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Croatica Chemica Acta 2001-04, Vol.74 (2), p.207
Hauptverfasser:	Bali ska, Krystyna T, Gargano, Michael L, Quintas, Louis V
Format:	Artikel
Sprache:	eng
Schlagworte:	bounded degree Markov chain random graph
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!