Laplacian integral graphs with maximum degree 3
type: Item
instance of: scholarly article
title: Laplacian integral graphs with maximum degree 3
zbMATH Open document ID: 1180.05063
published in: The Electronic Journal of Combinatorics
publication date: 2009-04-07T00:00:00Z
full work available at URL: https://eudml.org/doc/117270
full work available at URL: v15i1r120.html
review text: 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.
Mathematics Subject Classification ID: 05C50
Mathematics Subject Classification ID: 15A18
zbMATH DE Number: 5541025
zbMATH Keywords: Laplacian integral graphs
zbMATH Keywords: maximum degree 3
zbMATH Keywords: at least 6 vertices
author: S. J. Kirkland
MaRDI profile type: Publication
description: scientific article; zbMATH DE number 5541025