Laplacian integral graphs with maximum degree 3 (Q1010855)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Laplacian integral graphs with maximum degree 3 |
scientific article |
Statements
Laplacian integral graphs with maximum degree 3 (English)
0 references
7 April 2009
0 references
Summary: 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.
0 references
Laplacian integral graphs
0 references
maximum degree 3
0 references
at least 6 vertices
0 references
