应用数学2011，Vol.24Issue(4)：851-857,7.
随机图的谱矩
Spectral Moment of Random Graphs
摘要
Abstract
The k-th spectral moment for a simple graph G,denoted by Mk (G),is the sum of k-th power of eigenvalues of G.By probabilistie and algebraic approaches,we formulate an exact estimate to Mk (G) for almost all graphs.Furthermore,we establish a lower and upper bound to Mk (G) for almost all multipartite graphs.关键词
Erd(o)s-Rényi随机图/随机多部图/特征值/谱矩Key words
Erd(o)s-Rényi random graph/Random multipartite graph/Eigenvalues/Spectral moment分类
数理科学引用本文复制引用
陈志,范益政,杜文学..随机图的谱矩[J].应用数学,2011,24(4):851-857,7.基金项目
Supported by National Natural Science Foundation of China (11071002),Program for New Century Excellent Talents in University,Key Project of Chinese Ministry of Education (210091),Specialized Research Fund for the Doctoral Program of Higher Education (20103401110002),Anhui Provincial Natural Science Foundation (10040606Y33),Project of Educational Department of Anhui Province (KJ2010B136),Scientific Research Fund for Fostering Distinguished Young Scholars of Anhui University,Project for Academic Innovation Team of Anhui University (KJTD001B). （11071002）
