English

On the second smallest and the largest normalized Laplacian eigenvalues of a graph

Combinatorics 2016-03-15 v1

Abstract

Let GG be a simple connected graph with order nn. Let L(G)\mathcal{L}(G) be the normalized Laplacian matrix of GG. Let λk(G)\lambda_{k}(G) be the kk-th smallest normalized Laplacian eigenvalue of GG. Denote ρ(A)\rho(A) the spectral radius of the matrix AA. In this paper, we study the behaviors of λ2(G)\lambda_{2}(G) and ρ(L(G))\rho(\mathcal{L}(G)) when the graph is perturbed by three operations.

Keywords

Cite

@article{arxiv.1603.04301,
  title  = {On the second smallest and the largest normalized Laplacian eigenvalues of a graph},
  author = {Xiaoguo Tian and Ligong Wang and Yong Lu},
  journal= {arXiv preprint arXiv:1603.04301},
  year   = {2016}
}

Comments

14 pages, 3 figures

R2 v1 2026-06-22T13:10:19.750Z