Spectral Gap of the Largest Eigenvalue of the Normalized Graph Laplacian

  title={Spectral Gap of the Largest Eigenvalue of the Normalized Graph Laplacian},
  author={Jurgen Jost and Raffaella Mulas and Florentin M{\"u}nch},
  journal={arXiv: Spectral Theory},
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 equality is attained if and only if the complement graph is a single edge or a complete bipartite graph with both parts of size $\frac{n-1}2$. With the same method, we also prove a new lower bound to the largest eigenvalue in terms of the minimum vertex degree, provided this is at most $\frac{n-1}{2… 

Figures from this paper

Cheeger‐like inequalities for the largest eigenvalue of the graph Laplace operator
A new Cheeger-like constant for graphs is defined and it is used for proving Cheager-like inequalities that bound the largest eigenvalue of the normalized Laplace operator.
Interlacing Results for Hypergraphs
  • R. Mulas
  • Mathematics
    Proceedings of Blockchain in Kyoto 2021 (BCK21)
  • 2021
Hypergraphs are a generalization of graphs in which edges can connect any number of vertices. They allow the modeling of complex networks with higher-order interactions, and their spectral theory
On the Spectrum of Laplacian Matrix
Let G be a simple graph of order n. +e matrixL(G) � D(G) − A(G) is called the Laplacian matrix of G, where D(G) and A(G) denote the diagonal matrix of vertex degrees and the adjacency matrix of G,
Petals and Books: The largest Laplacian spectral gap from 1
We prove that, for any connected graph on N ≥ 3 vertices, the spectral gap from the value 1 with respect to the normalized Laplacian is at most 1/2. Moreover, we show that equality is achieved if and


Bounds on normalized Laplacian eigenvalues of graphs
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.
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
Spectral Graph Theory
Eigenvalues and the Laplacian of a graph Isoperimetric problems Diameters and eigenvalues Paths, flows, and routing Eigenvalues and quasi-randomness Expanders and explicit constructions Eigenvalues