Bounds on normalized Laplacian eigenvalues of graphs

Jianxi Li; Ji Ming Guo; Wai Chee Shiu

doi:10.1186/1029-242X-2014-316

Bounds on normalized Laplacian eigenvalues of graphs

Jianxi Li^*, Ji Ming Guo, Wai Chee Shiu

^*Corresponding author for this work

Department of Mathematics

Research output: Contribution to journal › Journal article › peer-review

25 Citations (Scopus)

Abstract

Let G be a simple connected graph of order n, where [InlineEquation not available: see fulltext.]. Its normalized Laplacian eigenvalues are [InlineEquation not available: see fulltext.]. In this paper, some new upper and lower bounds on [InlineEquation not available: see fulltext.] are obtained, respectively. Moreover, connected graphs with [InlineEquation not available: see fulltext.] (or [InlineEquation not available: see fulltext.]) are also characterized.

MSC:05C50, 15A48.

Original language	English
Article number	316
Journal	Journal of Inequalities and Applications
Volume	2014
Issue number	1
DOIs	https://doi.org/10.1186/1029-242X-2014-316
Publication status	Published - 1 Dec 2014

Scopus Subject Areas

Analysis
Discrete Mathematics and Combinatorics
Applied Mathematics

User-Defined Keywords

bound
largest eigenvalue
normalized Laplacian eigenvalue

Access to Document

10.1186/1029-242X-2014-316

Cite this

@article{fe2c9861de1749bc95c2d9f2e417db96,

title = "Bounds on normalized Laplacian eigenvalues of graphs",

abstract = "Let G be a simple connected graph of order n, where [InlineEquation not available: see fulltext.]. Its normalized Laplacian eigenvalues are [InlineEquation not available: see fulltext.]. In this paper, some new upper and lower bounds on [InlineEquation not available: see fulltext.] are obtained, respectively. Moreover, connected graphs with [InlineEquation not available: see fulltext.] (or [InlineEquation not available: see fulltext.]) are also characterized.MSC:05C50, 15A48.",

keywords = "bound, largest eigenvalue, normalized Laplacian eigenvalue",

author = "Jianxi Li and Guo, {Ji Ming} and Shiu, {Wai Chee}",

note = "Publisher Copyright: {\textcopyright} 2014, Li et al.; licensee Springer.",

year = "2014",

month = dec,

day = "1",

doi = "10.1186/1029-242X-2014-316",

language = "English",

volume = "2014",

journal = "Journal of Inequalities and Applications",

issn = "1025-5834",

publisher = "Springer Open",

number = "1",

}

TY - JOUR

T1 - Bounds on normalized Laplacian eigenvalues of graphs

AU - Li, Jianxi

AU - Guo, Ji Ming

AU - Shiu, Wai Chee

PY - 2014/12/1

Y1 - 2014/12/1

N2 - Let G be a simple connected graph of order n, where [InlineEquation not available: see fulltext.]. Its normalized Laplacian eigenvalues are [InlineEquation not available: see fulltext.]. In this paper, some new upper and lower bounds on [InlineEquation not available: see fulltext.] are obtained, respectively. Moreover, connected graphs with [InlineEquation not available: see fulltext.] (or [InlineEquation not available: see fulltext.]) are also characterized.MSC:05C50, 15A48.

AB - Let G be a simple connected graph of order n, where [InlineEquation not available: see fulltext.]. Its normalized Laplacian eigenvalues are [InlineEquation not available: see fulltext.]. In this paper, some new upper and lower bounds on [InlineEquation not available: see fulltext.] are obtained, respectively. Moreover, connected graphs with [InlineEquation not available: see fulltext.] (or [InlineEquation not available: see fulltext.]) are also characterized.MSC:05C50, 15A48.

KW - bound

KW - largest eigenvalue

KW - normalized Laplacian eigenvalue

UR - http://www.scopus.com/inward/record.url?scp=84929094151&partnerID=8YFLogxK

U2 - 10.1186/1029-242X-2014-316

DO - 10.1186/1029-242X-2014-316

M3 - Journal article

AN - SCOPUS:84929094151

SN - 1025-5834

VL - 2014

JO - Journal of Inequalities and Applications

JF - Journal of Inequalities and Applications

IS - 1

M1 - 316

ER -

Bounds on normalized Laplacian eigenvalues of graphs

Abstract

Scopus Subject Areas

User-Defined Keywords

Access to Document

Other files and links

Fingerprint

Cite this