Indecomposable laplacian integral graphs
Autor: | Robert Grone, Russell Merris |
---|---|
Rok vydání: | 2008 |
Předmět: |
Decomposable graph
Kronecker product Eigenvalue Cograph Combinatorics Spectrum Integral graph Discrete Mathematics and Combinatorics Isospectral Mathematics Discrete mathematics Algebraic connectivity Numerical Analysis Self-complementary graph Algebra and Number Theory Resistance distance Laplacian integral graph Graph join Mathematics::Spectral Theory Graph product Geometry and Topology Laplacian matrix Indecomposable module |
Zdroj: | Linear Algebra and its Applications. 428(7):1565-1570 |
ISSN: | 0024-3795 |
DOI: | 10.1016/j.laa.2007.09.025 |
Popis: | 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. |
Databáze: | OpenAIRE |
Externí odkaz: |