Some constructions of integral graphs |
| |
| Authors: | A. Mohammadian |
| |
| Affiliation: | School of Mathematics , Institute for Research in Fundamental Sciences (IPM) , P.O. Box 19395-5746, Tehran, Iran |
| |
| 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 article, we introduce some general methods for constructing such graphs. As a consequence, some infinite families of integral graphs are obtained. |
| |
| Keywords: | graph eigenvalue integral graph Kronecker product |
|
|
