Bounds on normalized Laplacian eigenvalues of graphs - Details

author：

Li, J. (Li, J..) ^[1] | Guo, J.-M. (Guo, J.-M..) ^[2] | Shiu, W.C. (Shiu, W.C..) ^[3]

Indexed by：

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.　©　2014,　Li　et　al.;　licensee　Springer.

Keyword：

bound; largest eigenvalue; normalized Laplacian eigenvalue

Community：

[ 1 ] [Li, J.]School of Mathematics and Statistics, Minnan Normal University, Zhangzhou, Fujian, China
[ 2 ] [Li, J.]Center for Discrete Mathematics, Fuzhou University, Fuzhou, Fujian, China
[ 3 ] [Guo, J.-M.]Department of Mathematics, East China University of Science and Technology, Shanghai, China
[ 4 ] [Shiu, W.C.]Department of Mathematics, Hong Kong Baptist University, Kowloon Tong, Hong Kong, China

Reprint 's Address：

[Li, J.]Center for Discrete Mathematics, Fuzhou UniversityChina

Email：

Show more details

Related Keywords：

Source ：

Journal of Inequalities and Applications

ISSN： 1025-5834

Year： 2014

Issue： 1

Volume： 2014

0 . 7 7 3

JCR@2014

1 . 5 0 0

JCR@2023

ESI HC Threshold：86

JCR Journal Grade：2

CAS Journal Grade：3

Cited Count：

WoS CC Cited Count：

SCOPUS Cited Count： 23

ESI Highly Cited Papers on the List： 0 Unfold All

WanFang Cited Count：

Chinese Cited Count：

30 Days PV： 1

Affiliated Colleges：

Get Fulltext

DOI Library Discovery Baidu Scholar Search SCOPUS

Type
Departments

All Years Choose Year From to