Integral graph

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. The notion was introduced in 1974 by Frank Harary and Allen Schwenk.

Examples

• The complete graph K_n is integral for all n.
• The only cycle graphs that are integral are [math]\displaystyle{ C_3 }[/math], [math]\displaystyle{ C_4 }[/math], and [math]\displaystyle{ C_6 }[/math].
• If a graph is integral, then so is its complement graph; for instance, the complements of complete graphs, edgeless graphs, are integral. If two graphs are integral, then so is their Cartesian product and strong product; for instance, the Cartesian products of two complete graphs, the rook's graphs, are integral. Similarly, the hypercube graphs, as Cartesian products of any number of complete graphs [math]\displaystyle{ K_2 }[/math], are integral.
• The line graph of an integral graph is again integral. For instance, as the line graph of [math]\displaystyle{ K_4 }[/math], the octahedral graph is integral, and as the complement of the line graph of [math]\displaystyle{ K_5 }[/math], the Petersen graph is integral.
• Among the cubic symmetric graphs the utility graph, the Petersen graph, the Nauru graph and the Desargues graph are integral.
• The Higman–Sims graph, the Hall–Janko graph, the Clebsch graph, the Hoffman–Singleton graph, the Shrikhande graph and the Hoffman graph are integral.
• A regular graph is periodic if and only if it is an integral graph.
• A walk-regular graph that admits perfect state transfer is an integral graph.
• The Sudoku graphs, graphs whose vertices represent cells of a Sudoku board and whose edges represent cells that should not be equal, are integral.