Bounds on normalized Laplacian eigenvalues of graphs

@article{Li2014BoundsON,
  title={Bounds on normalized Laplacian eigenvalues of graphs},
  author={Jianxi Li and Ji-Ming Guo and Wai Chee Shiu},
  journal={Journal of Inequalities and Applications},
  year={2014},
  volume={2014},
  pages={1-8}
}
Let G be a simple connected graph of order n, where n≥2. Its normalized Laplacian eigenvalues are 0=λ1≤λ2≤⋯≤λn≤2. In this paper, some new upper and lower bounds on λn are obtained, respectively. Moreover, connected graphs with λ2=1 (or λn−1=1) are also characterized.MSC:05C50, 15A48. 
Normalized Laplacian eigenvalues with chromatic number and independence number of graphs
ABSTRACT Let be the normalized Laplacian eigenvalues of a graph G with n vertices. Also, let χ and α be the chromatic number and the independence number of a graph G, respectively. In this paper, we
Extremal graph on normalized Laplacian spectral radius and energy
Let G = (V, E) be a simple graph of order n and the normalized Laplacian eigenvalues ρ1 ≥ ρ2 ≥ · · · ≥ ρn−1 ≥ ρn = 0. The normalized Laplacian energy (or Randić energy) of G without any isolated
Novel Bounds for the Normalized Laplacian Estrada and Normalized Energy Index of Graphs
For a simple and connected graph, several lower and upper bounds of graph invariants expressed in terms of the eigenvalues of the normalized Laplacian matrix have been proposed in literature. In this
Eigenvalue Bounds for Some Classes of Matrices Associated with Graphs
For a given complex square matrix A with constant row sum, we establish two new eigenvalue inclusion sets. Using these bounds, first, we derive bounds for the second largest and the smallest
Spectral Gap of the Largest Eigenvalue of the Normalized Graph Laplacian
We offer a new method for proving that the maximal eigenvalue of the normalized graph Laplacian of a graph with $n$ vertices is at least $\frac{n+1}{n-1}$ provided the graph is not complete and that
...
...

References

SHOWING 1-10 OF 16 REFERENCES
A few properties of the eigenvalues of normalized graph Laplacian
TLDR
Using the number and degrees of common neighbors between vertices some new upper bounds for the largest eigenvalue have been introduced.
An improved upper bound for the Laplacian spectral radius of graphs
A new upper bound on the largest normalized Laplacian eigenvalue
Let G be a simple undirected connected graph on n vertices. Suppose that the vertices of G are labelled 1,2, . . . ,n. Let di be the degree of the vertex i. The Randić matrix of G , denoted by R, is
THE NORMALIZED LAPLACIAN MATRIX AND GENERAL RANDI C INDEX OF GRAPHS
To any graph we may associate a matrix which records information about its structure. The goal of spectral graph theory is to see how the eigenvalues of such a matrix representation relate to the
Eigenvalues and structures of graphs
Given a graph we can associate several matrices which record information about vertices and how they are interconnected. The question then arises, given that you know the eigenvalues of some matrix
Spectra of Graphs: Theory and Applications
Introduction. Basic Concepts of the Spectrum of a Graph. Operations on Graphs and the Resulting Spectra. Relations Between Spectral and Structural Properties of Graphs. The Divisor of a Graph. The
An Introduction To The Theory Of Graph Spectra
TLDR
An introduction to the theory of graph spectra is available in the book collection an online access to it is set as public so you can download it instantly and is universally compatible with any devices to read.
...
...