摘要
本文利用有向循环图D（n,S）的矩阵表示,讨论了D（n,S）的一些谱性质。证明了D（n,S）强连通等价于其基础图连通,以及D（n,S）的连通分支数=g·c·d.（n,s_1,s_2,…s_r）=特征值│S│的重数。
This paper, we use matric expression of circulant digraph D(n,S). and show some spectra property of D(n,S). It is proved that necessary and sufficient condition of strong connexion of D(n,S) is connected with it's underlying graph. and the number connected component of D(n,S) = g·c·d.(n,s1,s2,…,Sr)=multiplicity of eigenvalue |S| is obtained.
出处
《赣南师范学院学报》
1996年第3期15-18,共4页
Journal of Gannan Teachers' College(Social Science(2))
关键词
有向循环图
图谱
循环图
谱性质
连通性
circulant digraph, circulamt matrix, spectra of graphs, connected property, number connected component
