\magnification=1200
\hsize=4in
\overfullrule=0pt
\input amssym
%\def\frac#1 #2 {{#1\over #2}}
\def\emph#1{{\it #1}}
\def\em{\it}
\nopagenumbers
\noindent
%
%
{\bf Steve Kirkland}
%
%
\medskip
\noindent
%
%
{\bf Laplacian Integral Graphs with Maximum Degree $3$}
%
%
\vskip 5mm
\noindent
%
%
%
%
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.

\bye