Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
121 tokens/sec
GPT-4o
9 tokens/sec
Gemini 2.5 Pro Pro
47 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Laplacians on bipartite metric graphs (1907.00791v2)

Published 1 Jul 2019 in math.SP, math-ph, and math.MP

Abstract: We study spectral properties of the standard (also called Kirchhoff) Laplacian and the anti-standard (or anti-Kirchhoff) Laplacian on a finite, compact metric graph. We show that the positive eigenvalues of these two operators coincide whenever the graph is bipartite; this leads to a precise relation between their eigenvalues enumerated with multiplicities and including the possible eigenvalue zero. Several spectral inequalities for, e.g., trees are among the consequences of this. In the second part we study inequalities between standard and Dirichlet eigenvalues in more detail and expose another connection to bipartiteness.

Summary

We haven't generated a summary for this paper yet.