High-ordered spectral characterizations of graphs

Lixiang Chen, Lizhu Sun, Changjiang Bu

The spectrum of the $k$-power hypergraph of a graph $G$ is called the $k$-ordered spectrum of $G$.If graphs $G_1$ and $G_2$ have same $k$-ordered spectrum for all positive integer…