On the second largest normalized Laplacian eigenvalue of graphs

Shaowei Sun and Kinkar Ch. Das

Applied Mathematics and Computation, 2019, vol. 348, issue C, 531-541

Abstract: Let G=(V,E) be a simple graph of order n with normalized Laplacian eigenvalues ρ1≥ρ2≥⋯≥ρn−1≥ρn=0. The normalized Laplacian spread of graph G, denoted by ρ1−ρn−1, is the difference between the largest and the second smallest normalized Laplacian eigenvalues of graph G. In this paper, we obtain the first four smallest values on ρ2 of graphs. Moreover, we give a lower bound on ρ2 of connected bipartite graph G except the complete bipartite graph and characterize graphs for which the bound is attained. Finally, we present some bounds on the normalized Laplacian spread of graphs and characterize the extremal graphs.

Keywords: The second largest normalized Laplacian eigenvalue; Graph; Bipartite graph; Normalized Laplacian spread; Randić energy (search for similar items in EconPapers)
Date: 2019
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300318310701
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:348:y:2019:i:c:p:531-541

DOI: 10.1016/j.amc.2018.12.023

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().