|
|||||
|
|
On the seidel integral complete multipartite graphs |
||
| Authors: | Sheng-mei Lv Liang Wei Hai-xing Zhao | |
| Affiliation: | 1. Department of Mathematics, Qinghai Nationality University, Xining, Qinghai, 810007, China 2. Department of Mathematics, Qinghai Normal University, Xining, Qinghai, 810008, China |
|
| Abstract: | For a simple undirected graph G, denote by A(G) the (0,1)-adjacency matrix of G. Let thematrix S(G) = J-I-2A(G) be its Seidel matrix, and let S G (??) = det(??I-S(G)) be its Seidel characteristic polynomial, where I is an identity matrix and J is a square matrix all of whose entries are equal to 1. If all eigenvalues of S G (??) are integral, then the graph G is called S-integral. In this paper, our main goal is to investigate the eigenvalues of S G (??) for the complete multipartite graphs G = $G = K_{n_1 ,n_2 ,...n_t } $ . A necessary and sufficient condition for the complete tripartite graphs K m,n,t and the complete multipartite graphs  | |
| Keywords: | S-polynomial S-integral complete multipartite graphs | |
| 本文献已被 维普 SpringerLink 等数据库收录！ | ||