Laplacian integral graphs with maximum degree 3.
The Electronic Journal of Combinatorics [electronic only] (2008)
- Volume: 15, Issue: 1, page Research Paper R120, 42 p.-Research Paper R120, 42 p.
- ISSN: 1077-8926
Access Full Article
top
How to cite
topKirkland, Steve. "Laplacian integral graphs with maximum degree 3.." The Electronic Journal of Combinatorics [electronic only] 15.1 (2008): Research Paper R120, 42 p.-Research Paper R120, 42 p.. <http://eudml.org/doc/117270>.
@article{Kirkland2008,
author = {Kirkland, Steve},
journal = {The Electronic Journal of Combinatorics [electronic only]},
keywords = {Laplacian integral graphs; maximum degree 3; at least 6 vertices},
language = {eng},
number = {1},
pages = {Research Paper R120, 42 p.-Research Paper R120, 42 p.},
publisher = {Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos},
title = {Laplacian integral graphs with maximum degree 3.},
url = {http://eudml.org/doc/117270},
volume = {15},
year = {2008},
}
TY - JOUR
AU - Kirkland, Steve
TI - Laplacian integral graphs with maximum degree 3.
JO - The Electronic Journal of Combinatorics [electronic only]
PY - 2008
PB - Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos
VL - 15
IS - 1
SP - Research Paper R120, 42 p.
EP - Research Paper R120, 42 p.
LA - eng
KW - Laplacian integral graphs; maximum degree 3; at least 6 vertices
UR - http://eudml.org/doc/117270
ER -
NotesEmbed ?
topYou must be logged in to post comments.
To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.