✦ LIBER ✦

Indecomposable laplacian integral graphs

✍ Scribed by Robert Grone; Russell Merris

Publisher: Elsevier Science
Year: 2008
Tongue: English
Weight: 189 KB
Volume: 428
Category: Article
ISSN: 0024-3795
DOI: 10.1016/j.laa.2007.09.025

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Constructably Laplacian integral graphs

✍ Steve Kirkland 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 229 KB

A graph is Laplacian integral if the spectrum of its Laplacian matrix consists entirely of integers. We consider the class of constructably Laplacian integral graphs -those graphs that be constructed from an empty graph by adding a sequence of edges in such a way that each time a new edge is added,

Degree maximal graphs are Laplacian inte

Degree maximal graphs are Laplacian integral

✍ Russell Merris 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 284 KB

Indecomposable graphs

✍ Pierre Ille 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 409 KB

Minimal indecomposable graphs

✍ Alain Cournier; Pierre Ille 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 1011 KB

Laplacian integral graphs in S(a, b

Laplacian integral graphs in S(a, b)

✍ Leonardo Silva de Lima; Nair Maria Maia de Abreu; Carla Silva Oliveira; Maria Ag 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 171 KB

On the conjecture for certain Laplacian

On the conjecture for certain Laplacian integral spectrum of graphs

✍ Kinkar Ch. Das; Sang-Gu Lee; Gi-Sang Cheon 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 184 KB 👁 1 views

## Abstract Let __G__ be a simple graph of order __n__ with Laplacian spectrum {λ~__n__~, λ~__n__−1~, …, λ~1~} where 0=λ~__n__~≤λ~__n__−1~≤⋅≤λ~1~. If there exists a graph whose Laplacian spectrum is __S__={0, 1, …, __n__−1}, then we say that __S__ is Laplacian realizable. In 6, Fallat et al. posed