In the mathematical field of graph theory, an integral graph is a graph whose adjacency matrix's spectrum consists entirely of integers.
In other words, a graph is an integral graph if all of the roots of the characteristic polynomial of its adjacency matrix are integers.
[1] The notion was introduced in 1974 by Frank Harary and Allen Schwenk.
[2]