Bounds on normalized Laplacian eigenvalues of graphs

31Citations
Citations of this article
10Readers
Mendeley users who have this article in their library.

This article is free to access.

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.

Cite

CITATION STYLE

APA

Li, J., Guo, J. M., & Shiu, W. C. (2014). Bounds on normalized Laplacian eigenvalues of graphs. Journal of Inequalities and Applications, 2014(1). https://doi.org/10.1186/1029-242X-2014-316

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free