摘要
如果一个图G的邻接矩阵A(G)的特征多项式的所有特征值全为整数,则称图G是整的。设图L2(Kp)=L(S(Kp))是完全图Kp的剖分图S(Kp)的线图。在这篇文章里,我们利用图的理论给出了S(Kp)和L2(Kp)的特征多项式及其谱。对于图L2(Kp)。得到了其补图、线图、线图的补图及补图的线图的特征多项式。也证明了这些图都是整图。这些整图的发现是对整图的研究的一个新贡献。
A graph G is called integral if all eigenvalues of the adjacency matrix A(a)of G are integers. Let L2(Kp)=L(S(Kp))be the line graph of the subdivision graph S(Kp) of the complete graph Kp. In this paper, we shall give the spectra and characteristic polynomials of S(Kp) and L2(Kp)from the theory on graphs. For the graph L2(Kp),we derive the characteristic polynomials for its complement graph, its line graph, the complement graph of its line graph and the line graph of its complement graph.We also prove these graphs are integral graphs.The discovery of these integral graphs is a new contribution to the research of integral graphs.
出处
《工程数学学报》
CSCD
北大核心
2007年第4期593-597,共5页
Chinese Journal of Engineering Mathematics
基金
NSFC(60642002,70571065)
"DPOP" in NPU
关键词
整图
图的谱
特征多项式
PELL方程
integral graph
graph spectrum
characteristic polynomial
Pell's equation