✦ LIBER ✦

The Laplacian spectrum of a graph

✍ Scribed by K.Ch. Das

Book ID: 108076901
Publisher: Elsevier Science
Year: 2004
Tongue: English
Weight: 509 KB
Volume: 48
Category: Article
ISSN: 0898-1221
DOI: 10.1016/j.camwa.2004.05.005

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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.

The spectrum of the continuous Laplacian

The spectrum of the continuous Laplacian on a graph

✍ Carla Cattaneo 📂 Article 📅 1997 🏛 Springer Vienna 🌐 English ⚖ 923 KB

On the Laplacian spectrum of an infinite

On the Laplacian spectrum of an infinite graph

✍ A. Torgašev; M. Petrović 📂 Article 📅 2006 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 202 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

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

On the spectrum of the normalized graph

On the spectrum of the normalized graph Laplacian

✍ Anirban Banerjee; Jürgen Jost 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 114 KB