Eigenvalue bounds of the Kirchhoff Laplacian

05/23/2022
by   Oliver Knill, et al.
0

We prove that each eigenvalue l(k) of the Kirchhoff Laplacian K of a graph or quiver is bounded above by d(k)+d(k-1) for all k in 1,...,n. Here l(1),...,l(n) is a non-decreasing list of the eigenvalues of K and d(1),..,d(n) is a non-decreasing list of vertex degrees with the additional assumption d(0)=0. We also prove that in general the weak Brouwer-Haemers lower bound d(k) + (n-k) holds for all eigenvalues l(k) of the Kirchhoff matrix of a quiver.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/03/2023

Spectral monotonicity of the Hodge Laplacian

If K,G are finite abstract simplicial complexes and K is a subcomplex of...
research
09/27/2022

Shape optimization for the Laplacian eigenvalue over triangles and its application to interpolation error constant estimation

A computer-assisted proof is proposed for the Laplacian eigenvalue minim...
research
06/20/2022

Extremal graph realizations and graph Laplacian eigenvalues

For a regular polyhedron (or polygon) centered at the origin, the coordi...
research
05/19/2022

Explainable Graph Theory-Based Identification of Meter-Transformer Mapping

Distributed energy resources are better for the environment but may caus...
research
05/25/2022

Eigenvalues of the laplacian matrices of the cycles with one weighted edge

In this paper we study the eigenvalues of the laplacian matrices of the ...
research
03/05/2021

Formalizing Graph Trail Properties in Isabelle/HOL

We describe a dataset expressing and proving properties of graph trails,...
research
02/16/2022

Flat tori with large Laplacian eigenvalues in dimensions up to eight

We consider the optimization problem of maximizing the k-th Laplacian ei...

Please sign up or login with your details

Forgot password? Click here to reset