On the second smallest and the largest normalized Laplacian eigenvalues of a graph
Combinatorics
2016-03-15 v1
Abstract
Let be a simple connected graph with order . Let be the normalized Laplacian matrix of . Let be the -th smallest normalized Laplacian eigenvalue of . Denote the spectral radius of the matrix . In this paper, we study the behaviors of and 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