𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Towards a spectral theory of graphs based on the signless Laplacian, II

✍ Scribed by Dragoš Cvetković; Slobodan K. Simić

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

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the signless Laplacian spectral radiu
On the signless Laplacian spectral radius of graphs with cut vertices
✍ Bao-Xuan Zhu 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 129 KB

In this paper, we show that among all the connected graphs with n vertices and k cut vertices, the maximal signless Laplacian spectral radius is attained uniquely at the graph G n,k , where G n,k is obtained from the complete graph K n-k by attaching paths of almost equal lengths to all vertices of

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