𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Some results on the Laplacian spectrum

✍ Scribed by Muhuo Liu; Bolian Liu


Book ID
104008861
Publisher
Elsevier Science
Year
2010
Tongue
English
Weight
290 KB
Volume
59
Category
Article
ISSN
0898-1221

No coin nor oath required. For personal study only.

✦ Synopsis


A graph is called a Laplacian integral graph if the spectrum of its Laplacian matrix consists of integers, and a graph G is said to be determined by its Laplacian spectrum if there does not exist other non-isomorphic graph H such that H and G share the same Laplacian spectrum. In this paper, we obtain a sharp upper bound for the algebraic connectivity of a graph, and identify all the Laplacian integral unicyclic, bicyclic graphs. Moreover, we show that all the Laplacian integral unicyclic, bicyclic graphs are determined by their Laplacian spectra.


πŸ“œ SIMILAR VOLUMES


On some forests determined by their Lapl
✍ Slobodan K. SimiΔ‡; Zoran StaniΔ‡ πŸ“‚ Article πŸ“… 2009 πŸ› Elsevier Science 🌐 English βš– 571 KB

The largest eigenvalues a b s t r a c t We consider the class of graphs whose each component is either a proper subgraph of some Smith graphs, or belongs to a precized subset of Smith graphs. We classify the graphs from the considered class into those which are determined, or not determined, by Lap

Some results on the signless Laplacians
✍ 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

On the spectrum of the Laplacian
✍ Charalambous, Nelia; Lu, Zhiqin πŸ“‚ Article πŸ“… 2013 πŸ› Springer 🌐 English βš– 308 KB