✦ LIBER ✦

On the spectrum of the normalized graph Laplacian

✍ Scribed by Anirban Banerjee; Jürgen Jost

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

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the Laplacian Spectrum of (α, ω) -Gra

On the Laplacian Spectrum of (α, ω) -Graphs

✍ Alexander Kelmans 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 111 KB

We study the Laplacian spectrum of (α, ω)-graphs which play an important role in the theory of perfect graphs. The properties of the spectrum we found allow the establishment of some structural properties of (α, ω)-graphs. We describe, in particular, a class of graphs that are not subgraphs of (α, ω

Pure Point Spectrum of the Laplacians on

Pure Point Spectrum of the Laplacians on Fractal Graphs

✍ L. Malozemov; A. Teplyaev 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 514 KB

On the Szeged and the Laplacian Szeged s

On the Szeged and the Laplacian Szeged spectrum of a graph

✍ Gholam Hossein Fath-Tabar; Tomislav Došlić; Ali Reza Ashrafi 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 171 KB

Subgraphs and the Laplacian spectrum of

Subgraphs and the Laplacian spectrum of a graph

✍ Yasuo Teranishi 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 160 KB

Let G be a graph and H a subgraph of G. In this paper, a set of pairwise independent subgraphs that are all isomorphic copies of H is called an H-matching. Denoting by ν(H, G) the cardinality of a maximum H-matching in G, we investigate some relations between ν(H, G) and the Laplacian spectrum of G.

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

On the reduced signless Laplacian spectr

On the reduced signless Laplacian spectrum of a degree maximal graph

✍ Bit-Shun Tam; Shu-Hui Wu 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 314 KB

For a (simple) graph G, the signless Laplacian of G is the matrix A(G) + D(G), where A(G) is the adjacency matrix and D(G) is the diagonal matrix of vertex degrees of G; the reduced signless Laplacian of G is the matrix (G) + B(G), where B(G) is the reduced adjacency matrix of G and (G) is the diago