Degree maximal graphs are Laplacian integral
A graph is maximal if its degree sequence is majorized by no other graphic sequence. The author presents an algorithmic construction of all maximal graphs. It follows that the Laplacian spectrum of a maximal graph is the conjugate of its degree sequence.
scientific article; zbMATH DE number 566110