2010
DOI: 10.1016/j.laa.2010.01.027
|View full text |Cite
|
Sign up to set email alerts
|

Bounds and conjectures for the signless Laplacian index of graphs

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
29
0

Year Published

2014
2014
2018
2018

Publication Types

Select...
7
1

Relationship

0
8

Authors

Journals

citations
Cited by 42 publications
(29 citation statements)
references
References 17 publications
0
29
0
Order By: Relevance
“…. , n−1) [29] (See page 3323), respectively. Consequently, the signless Laplacian eigenvalues of P m P n (resp.…”
Section: Asymptotic Incidence Energy Of Square Latticesmentioning
confidence: 99%
“…. , n−1) [29] (See page 3323), respectively. Consequently, the signless Laplacian eigenvalues of P m P n (resp.…”
Section: Asymptotic Incidence Energy Of Square Latticesmentioning
confidence: 99%
“…Hansen and Lucas in [1] established two conjectures relating the eigenvalue q 1 and the independence number α as one can see below.…”
Section: Introductionmentioning
confidence: 98%
“…Recently there is a lot of work on the spectral radius or the signless Laplacian spectral radius of graphs, see [6,13,14,15,17,19,24,26,28,32,36,40,41,45,49] et al Some investigation on graphs with prefect matching or with given matching number is an important topic in the theory of graph spectra, see [7, 8, [32] determined the unique graph with the maximum signless Laplacian spectral radius among all cacti in ℓ m n with n = 2m, and gave a conjecture about the case n ≥ 2m + 1 as follows.…”
Section: Introductionmentioning
confidence: 99%