Geodesic
Laplacian integral graphs with maximum degree 3
The electronic journal of combinatorics, Tome 15 (2008)
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

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.
DOI : 10.37236/844
Classification : 05C50, 15A18
Mots-clés : Laplacian integral graphs, maximum degree 3, at least 6 vertices 
@article{10_37236_844,
     author = {Steve Kirkland},
     title = {Laplacian integral graphs with maximum degree 3},
     journal = {The electronic journal of combinatorics},
     year = {2008},
     volume = {15},
     doi = {10.37236/844},
     zbl = {1180.05063},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/844/}
}
TY  - JOUR
AU  - Steve Kirkland
TI  - Laplacian integral graphs with maximum degree 3
JO  - The electronic journal of combinatorics
PY  - 2008
VL  - 15
UR  - http://geodesic.mathdoc.fr/articles/10.37236/844/
DO  - 10.37236/844
ID  - 10_37236_844
ER  - 
%0 Journal Article
%A Steve Kirkland
%T Laplacian integral graphs with maximum degree 3
%J The electronic journal of combinatorics
%D 2008
%V 15
%U http://geodesic.mathdoc.fr/articles/10.37236/844/
%R 10.37236/844
%F 10_37236_844
Steve Kirkland. Laplacian integral graphs with maximum degree 3. The electronic journal of combinatorics, Tome 15 (2008). doi: 10.37236/844

Cité par Sources :