✦ LIBER ✦

The signless Laplacian spread

✍ Scribed by Muhuo Liu; Bolian Liu

Publisher: Elsevier Science
Year: 2010
Tongue: English
Weight: 174 KB
Volume: 432
Category: Article
ISSN: 0024-3795
DOI: 10.1016/j.laa.2009.08.025

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Bounds for the signless Laplacian energy

✍ Nair Abreu; Domingos M. Cardoso; Ivan Gutman; Enide A. Martins; Marı´a Robbiano 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 233 KB

Signless Laplacians of finite graphs

✍ Dragoš Cvetković; Peter Rowlinson; Slobodan K. Simić 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 191 KB

We survey properties of spectra of signless Laplacians of graphs and discuss possibilities for developing a spectral theory of graphs based on this matrix. For regular graphs the whole existing theory of spectra of the adjacency matrix and of the Laplacian matrix transfers directly to the signless L

The smallest eigenvalue of the signless

The smallest eigenvalue of the signless Laplacian

✍ Leonardo Silva de Lima; Carla Silva Oliveira; Nair Maria Maia de Abreu; Vladimir 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 359 KB

Signless Laplacian spectral radius and H

Signless Laplacian spectral radius and Hamiltonicity

✍ Bo Zhou 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 112 KB

We give tight conditions on the signless Laplacian spectral radius of a graph for the existence of Hamiltonian paths and cycles.

Some results on the signless Laplacians

Some results on the signless Laplacians of graphs

✍ Jianfeng Wang; Qiongxiang Huang; Xinhui An; Francesco Belardo 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 277 KB

In this paper we give two results concerning the signless Laplacian spectra of simple graphs. Firstly, we give a combinatorial expression for the fourth coefficient of the (signless Laplacian) characteristic polynomial of a graph. Secondly, we consider limit points for the (signless Laplacian) eigen

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