Laplacian integral graphs with maximum degree 3 (Q1010855)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Laplacian integral graphs with maximum degree 3 |
scientific article; zbMATH DE number 5541025
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Laplacian integral graphs with maximum degree 3 |
scientific article; zbMATH DE number 5541025 |
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
0.8858017921447754
0 references
0.8633177280426025
0 references
0.8430095314979553
0 references
0.8255963921546936
0 references
0.8245088458061218
0 references
