Eigenvalue sums of combinatorial magnetic Laplacians on finite graphs

DOI10.7153/OAM-2018-12-54MaRDI QIDQ4558403zbMATH OpenOpenAlexWikidataFDO

Authors John Dever

Publication date 22 November 2018

Published in Operators and Matrices (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1609.05999

zbMATH Keywords

adjacency matrixgraph spectrumgraph Laplacianeigenvalue inequalitieseigenvalue sumshalf-bandmagnetic graph Laplacian

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Directed graphs (digraphs), tournaments (05C20) Inequalities involving eigenvalues and eigenvectors (15A42) Hermitian, skew-Hermitian, and related matrices (15B57) Coloring of graphs and hypergraphs (05C15)

Abstract: We give a construction of a class of magnetic Laplacian operators on finite directed graphs. We study some general combinatorial and algebraic properties of operators in this class before applying the Harrell-Stubbe Averaged Variational Principle to derive several sharp bounds on sums of eigenvalues of such operators. In particular, among other inequalities, we show that if $G$ is a directed graph on $n$ vertices arising from orienting a connected subgraph of $d$-regular loopless graph on $n$ vertices, then if $Delt{a}_{h}eta$ is any magnetic Laplacian on $G$, of which the standard combinatorial Laplacian is a special case, and $lambd{a}_{0}leqlambd{a}_{1}leq\mathrm{...}leqlambd{a}_{n-1}$ are the eigenvalues of $Delt{a}_{heta},$ then for $kleqfracn2,$ we have [frac{1}{k}sum_{j=0}^{k-1}lambda_j leq d-1.]

Recommendations

• On sums of graph eigenvalues
• Eigenvalue sum estimates for lattice subgraphs
• On Laplacian eigenvalues of connected graphs.
• An interlacing approach for bounding the sum of Laplacian eigenvalues of graphs
• Eigenvalues of the Laplacian of a graph^∗

Cites work

• scientific article; zbMATH DE number 1454646 (Why is no real title available?)
• scientific article; zbMATH DE number 3209277 (Why is no real title available?)
• Discrete geometric analysis
• Fluxes, Laplacians, and Kasteleyn's theorem
• On sums of graph eigenvalues

Cited in

(3)

• Sums of magnetic eigenvalues are maximal on rotationally symmetric domains
• On sums of graph eigenvalues
• Eigenvalue sum estimates for lattice subgraphs

This page was built for publication: Eigenvalue sums of combinatorial magnetic Laplacians on finite graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4558403)