Laplacian Integral Graphs with Maximum Degree $3$

Steve Kirkland

Abstract


A graph is said to be Laplacian integral if the spectrum of its Laplacian matrix consists entirely of integers. Using combinatorial and matrix-theoretic techniques, we identify, up to isomorphism, the $21$ connected Laplacian integral graphs of maximum degree $3$ on at least $6$ vertices.


Full Text: PDF