✦ LIBER ✦

Minimum vertex covers and the spectrum of the normalized Laplacian on trees

✍ Scribed by Hao Chen; Jürgen Jost

Book ID: 113772341
Publisher: Elsevier Science
Year: 2012
Tongue: English
Weight: 390 KB
Volume: 437
Category: Article
ISSN: 0024-3795
DOI: 10.1016/j.laa.2012.04.005

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

On the spectrum of the normalized Laplac

On the spectrum of the normalized Laplacian for signed graphs: Interlacing, contraction, and replication

✍ Atay, Fatihcan M.; Tunçel, Hande 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 290 KB

On the Laplacian, signless Laplacian and

On the Laplacian, signless Laplacian and normalized Laplacian characteristic polynomials of a graph

✍ Guo, Ji-Ming; Li, Jianxi; Shiu, Wai Chee 📂 Article 📅 2013 🏛 Springer 🌐 English ⚖ 187 KB

On computing the minimum 3-path vertex c

On computing the minimum 3-path vertex cover and dissociation number of graphs

✍ František Kardoš; Ján Katrenič; Ingo Schiermeyer 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 314 KB

Absence of Absolutely Continuous Spectru

Absence of Absolutely Continuous Spectrum for the Kirchhoff Laplacian on Radial Trees

✍ Pavel Exner, Christian Seifert, Peter Stollmann 📂 Article 📅 2013 🏛 Springer 🌐 English ⚖ 254 KB

On the characteristic and Laplacian poly

On the characteristic and Laplacian polynomials of trees

✍ Abbas Heydari; Bijan Taeri 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 232 KB

We find the characteristic polynomials of adjacency and Laplacian matrices of arbitrary unweighted rooted trees in term of vertex degrees, using the concept of the rooted product of graphs. Our result generalizes a result of Rojo and Soto [O. Rojo, R. Soto, The spectra of the adjacency matrix and La