摘要
本文通过组合数学和矩阵论的方法获得了完全图的特征多项式和谱,指出完全图的特征多项式的系数与图的结构之间的关系,并证明了邻接谱、拉谱拉斯谱和无符号拉谱拉斯谱三者之间的关系。
In this paper,the characteristic polynomials and spectrum of complete graphs are obtained by ways of combinatory mathematics and theory matrix. Then the relationship between the coefficients of the characteristic polynomials of complete graphs and its graphical construction is indicated. Lastly the relationship among adjacency spectrum,Laplacian spectrum and signless Laplacian spectrum of complete graphs are proved.
出处
《长春师范大学学报》
2015年第6期6-9,共4页
Journal of Changchun Normal University
基金
国家自然科学基金资助项目(11301470)
关键词
完全图
多项式
邻接谱
拉谱拉斯谱
complete graph
characteristic polynomial
adjacency spectrum
Laplacian spectrum
