✦ LIBER ✦

The coefficients of Laplacian characteristic polynomials of graphs

✍ Scribed by Wei Qiu; Weigen Yan

Book ID: 113772219
Publisher: Elsevier Science
Year: 2012
Tongue: English
Weight: 226 KB
Volume: 436
Category: Article
ISSN: 0024-3795
DOI: 10.1016/j.laa.2011.12.020

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

The characteristic polynomials of modifi

The characteristic polynomials of modified graphs

✍ Peter Rowlinson 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 678 KB

Characteristic polynomials of symmetric

Characteristic polynomials of symmetric graphs

✍ Kai Wang 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 215 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

On the Laplacian coefficients of acyclic

On the Laplacian coefficients of acyclic graphs

✍ Bojan Mohar 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 121 KB

Let G be a graph of order n and let (G, λ) = n k=0 (-1) k c k λ n-k be the characteristic polynomial of its Laplacian matrix. Zhou and Gutman recently proved that among all trees of order n, the kth coefficient c k is largest when the tree is a path, and is smallest for stars. A new proof and a stre

On the Laplacian coefficients of unicycl

On the Laplacian coefficients of unicyclic graphs

✍ Dragan Stevanović; Aleksandar Ilić 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 296 KB