Font Size: a A A

On Some Seidel Integral Graphs

Posted on:2010-04-05Degree:MasterType:Thesis
Country:ChinaCandidate:Y P YiFull Text:PDF
GTID:2120360275468527Subject:Basic mathematics
Abstract/Summary:PDF Full Text Request
The set of all the eigenvalues of a graph is called its spectrum. Let G be a simple graph of order n. Its Seidel adjacency matrix is denoted by A*(G) = J - I - 2A. A graph G is called Seidel integral if its Seidel spectrum consists entirely of integers. The estimation on graphs by its spectrum is an active question for discussion, moreover integral graph is a special class. There are many results about integral graphs. But for Seidel integral graphs, there are few about it. This paper determines all the Seidel integral graphs ofαKa∪βKb,αKa∪βCP(b) andαKa,a∪βCP(b) mainly by the main eigenvalue relation between adjacency matrix and Seidel adjacency matrix and Diophantine equation. In this paper, we obtain thatDetermination about all the Seidel integral graphs ofαKa∪βKb,αKa∪βCP(b) andαKa,a∪βCP(b). For example:LetαKa∪βKb is seidel integral, then its form is followed:among (i) t, k,l, n,m,f,e, h∈N, and (m,n) = 1, (f, e) = 1;(iv) (?), andτ| kt;(iii) (x0, y0) is a special root of (?);(iv) z≥z0, z0 is minimal integral number which satisfy the following condition,Finally we make apply of the main eigenvalue relation and Diophantine equation, and obtain the detail forms. That is the main part of this paper.
Keywords/Search Tags:Seidel integral graph, main eigenvalue, Diophantine equation, complete graph, complete bipartite graph, Cocktail party graph
PDF Full Text Request
Related items