In the mathematical field of graph theory, an integral graph is a graph whose spectrum consists entirely of integers. In other words, a graph is an integral graph if all of the roots of its characteristic polynomial are integers.
The notion was introduced in 1974 by Harary and Schwenk.