On Symmetry of Uniform and Preferential Attachment Graphs

Electronic Journal Of Combinatorics

Abram Magner¹ 

关键词: preferential attachment;    symmetry;    automorphism;    random graphs;   

DOI  :  

学科分类：离散数学和组合数学

来源: Electronic Journal Of Combinatorics

【 摘 要 】

Motivated by the problem of graph structure compression under realistic source models, we study the symmetry behavior of preferential and uniform attachment graphs. These are two dynamic models of network growth in which new nodes attach to a constant num

【 授权许可】

Others