𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Semiregular trees with minimal Laplacian spectral radius

✍ Scribed by Türker Bıyıkoğlu; Josef Leydold

Publisher
Elsevier Science
Year
2010
Tongue
English
Weight
154 KB
Volume
432
Category
Article
ISSN
0024-3795

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Trees with minimal Laplacian coefficient
Trees with minimal Laplacian coefficients
✍ Aleksandar Ilić 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 408 KB

Let G be a simple undirected graph with the characteristic polynomial of its Laplacian matrix L(G), P(G, µ) = n k=0 (-1) k c k µ n-k . It is well known that for trees the Laplacian coefficient c n-2 is equal to the Wiener index of G, while c n-3 is equal to the modified hyper-Wiener index of the gra

On the Laplacian spectral radius of a tr
On the Laplacian spectral radius of a tree
✍ Ji-Ming Guo 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 84 KB

Let G be a graph; its Laplacian matrix is the difference of the diagonal matrix of its vertex degrees and its adjacency matrix. In this paper, we present a sharp upper bound for the Laplacian spectral radius of a tree in terms of the matching number and number of vertices, and deduce from that the l

Graphs with maximal signless Laplacian s
Graphs with maximal signless Laplacian spectral radius
✍ Ting-Jung Chang; Bit-Shun Tam 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 340 KB

By the signless Laplacian of a (simple) graph G we mean the matrix , where A(G), D(G) denote respectively the adjacency matrix and the diagonal matrix of vertex degrees of G. It is known that connected graphs G that maximize the signless Laplacian spectral radius ρ(Q (G)) over all connected graphs