Abstract
A graph G is called integral or Laplacian integral if all the eigenvalues of the adjacency matrix A(G) or the Laplacian matrix Lap(G) = D(G) - A(G) of G are integers, where D(G) denote the diagonal matrix of the vertex degrees of G. Let Kn,n+1 ≡ Kn+1,nand K1,p[(p-1)K p] denote the (n+1)-regular graph with 4n+2 vertices and the p-regular graph with p2 + l vertices, respectively. In this paper, we shall give the spectra and characteristic polynomials of Kn,n+1 ≡ Kn+1,n and K1,p[(p - 1)Kp] from the theory on matrices. We derive the characteristic polynomials for their complement graphs, their line graphs, the complement graphs of their line graphs and the line graphs of their complement graphs. We also obtain the numbers of spanning trees for such graphs. When p = n2 + n + 1, these graphs are not only integral but also Laplacian integral. The discovery of these integral graphs is a new contribution to the search of integral graphs.
Original language | English |
---|---|
Pages (from-to) | 303-319 |
Number of pages | 17 |
Journal | Ars Combinatoria |
Volume | 76 |
State | Published - Jul 2005 |
Keywords
- Block circulant matrix
- Graph spectrum
- Integral graph
- Laplacian integral
- Regular graph