𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The least eigenvalue of signless Laplacian of non-bipartite graphs with given domination number

✍ Scribed by Fan, Yi-Zheng; Tan, Ying-Ying

Book ID
125802586
Publisher
Elsevier Science
Year
2014
Tongue
English
Weight
410 KB
Volume
334
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A sharp lower bound for the least eigenv
A sharp lower bound for the least eigenvalue of the signless Laplacian of a non-bipartite graph
✍ Domingos M. Cardoso; DragoΕ‘ CvetkoviΔ‡; Peter Rowlinson; Slobodan K. SimiΔ‡ πŸ“‚ Article πŸ“… 2008 πŸ› Elsevier Science 🌐 English βš– 149 KB

We prove that the minimum value of the least eigenvalue of the signless Laplacian of a connected nonbipartite graph with a prescribed number of vertices is attained solely in the unicyclic graph obtained from a triangle by attaching a path at one of its endvertices.

Signless Laplacian spectral radii of gra
Signless Laplacian spectral radii of graphs with given chromatic number
✍ Guanglong Yu; Yarong Wu; Jinlong Shu πŸ“‚ Article πŸ“… 2011 πŸ› Elsevier Science 🌐 English βš– 263 KB

Let G be a simple graph with vertices v 1 , v 2 , . . . , v n , of degrees = ) is called the signless Laplacian spectral radius or Q -spectral radius of G. Denote by Ο‡(G) the chromatic number for a graph G. In this paper, for graphs with order n, the extremal graphs with both the given chromatic num