完全图的seidel特征多项式及其谱  

The seidel characteristic polynomial and seidel spectra of complete graph

作　　者：吕盛梅[1] 

机构地区：[1]青海民族学院数学学院,青海西宁810007

出　　处：《青海师范大学学报（自然科学版）》2008年第4期7-9,共3页Journal of Qinghai Normal University(Natural Science Edition)

摘　　要：设A(G)是图G的邻接矩阵,J是全1方阵,I是单位矩阵.称S(G)=J-I-2A(G)为图G的seidel矩阵,与之对应的多项式SG(λ)=│Iλ-S(G)│称为图G的seidel特征多项式.本文给出了完全图Kn的seidel特征多项式及其谱.Let matrix A（G） he adjacency matrix of graph G,J is a square matrix all of whose entries are equal to 1, I is the identity matrix. The matrix S（G）=J--I--2A（G） is called the seidel matrix of G. The polynomial SG（λ）=｜λI-S（G）｜ is defined as the seidel characteristic polynomial of G with respect to the seidel matrix. In this paper, we show that the seidel characteristic polynomia and seidel spectral of complete graphs.

关 键 词：完全图 seidel特征多项式 seidel谱 

分 类 号：O157.6[理学—数学]