✦ LIBER ✦

On the ordering of trees by the Laplacian coefficients

✍ Scribed by Aleksandar Ilić

Publisher: Elsevier Science
Year: 2009
Tongue: English
Weight: 212 KB
Volume: 431
Category: Article
ISSN: 0024-3795
DOI: 10.1016/j.laa.2009.07.022

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Ordering trees by the Laplacian coeffici

Ordering trees by the Laplacian coefficients

✍ Xiao-Dong Zhang; Xia-Ping Lv; Ya-Hong Chen 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 247 KB

Ordering of trees with fixed matching nu

Ordering of trees with fixed matching number by the Laplacian coefficients

✍ Shushan He; Shuchao Li 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 448 KB

On the sth Laplacian eigenvalue of trees

On the sth Laplacian eigenvalue of trees of order

✍ Oscar Rojo 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 134 KB

On the second Laplacian eigenvalues of t

On the second Laplacian eigenvalues of trees of odd order

✍ Jia-yu Shao; Li Zhang; Xi-ying Yuan 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 157 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