
doi: 10.37236/844
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.
maximum degree 3, Eigenvalues, singular values, and eigenvectors, Graphs and linear algebra (matrices, eigenvalues, etc.), Laplacian integral graphs, at least 6 vertices
maximum degree 3, Eigenvalues, singular values, and eigenvectors, Graphs and linear algebra (matrices, eigenvalues, etc.), Laplacian integral graphs, at least 6 vertices
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 4 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
