“School of Mathematics”
Back to Papers HomeBack to Papers of School of Mathematics
| Paper IPM / M / 11419 |
|
||||
| Abstract: | |||||
|
A graph is called integral if all eigenvalues of its adjacency matrix
consist entirely of integers. Integral graphs are very rare and difficult to find.
In this paper, we introduce some general methods for constructing such graphs.
As a consequence, some infinite families of integral graphs are obtained.
Download TeX format |
|||||
| back to top | |||||
