More on the normalized Laplacian Estrada index
2014 ◽
Vol 8
(2)
◽
pp. 346-357
◽
Keyword(s):
Let G be a simple graph of order N. The normalized Laplacian Estrada index of G is defined as NEE(G)=?Ni=1 e?i?1, where ?1, ?2,... , ?N are the normalized Laplacian eigenvalues of G. In this paper, we give a tight lower bound for NEE of general graphs. We also calculate NEE for a class of treelike fractals, which contains T fractal and Peano basin fractal as its limiting cases. It is shown that NEE scales linearly with the order of the fractal, in line with a best possible lower bound for connected bipartite graphs.
2003 ◽
Vol 12
(5-6)
◽
pp. 477-494
◽
Keyword(s):
2015 ◽
Vol 29
◽
pp. 237-253
◽
Keyword(s):
Keyword(s):
2021 ◽
Vol 2021
◽
pp. 1-9
Keyword(s):
1995 ◽
Vol 4
(1)
◽
pp. 81-95
◽
2000 ◽
Vol 47
(3)
◽
pp. 205-215
◽
2009 ◽
Vol 430
(8-9)
◽
pp. 2503-2510
◽