Two Models for Random Graphs with Bounded Degree

Croatica Chemica Acta

Quintas, Louis V.¹  Gargano, Michael L.²    ska, Krystyna T.³ 

[1] Mathematics Department, Pace University, New York, NY 10038, USA;Computer Science Department, Pace University, New York, NY 10038, USA;Computer Science Center, The Technical University of Poznań, pl. M. Skłodowskiej-Curie 5, 60-965 Poznań, Poland

关键词: random graph;    Markov chain;    bounded degree;   

DOI  :  

学科分类：化学（综合）

来源: Croatica Chemica Acta

【 摘 要 】

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

【 授权许可】

Unknown