| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4602736 | Linear Algebra and its Applications | 2008 | 6 Pages |
Abstract
A graph that can be constructed from isolated vertices by the operations of union and complement is decomposable. Every decomposable graph is Laplacian integral. i.e., its Laplacian spectrum consists entirely of integers. An indecomposable graph is not decomposable. The main purpose of this note is to demonstrate the existence of infinitely many indecomposable Laplacian integral graphs.
Related Topics
Physical Sciences and Engineering
Mathematics
Algebra and Number Theory
