Eigenvalue bracketing for discrete and metric graphs

Simple item page
dc.creatorPost, Olaf
dc.creatorLledo, Fernando
dc.date2008-04-07
dc.date.accessioned2026-07-07T09:30:51Z
dc.date.available2026-07-07T09:30:51Z
dc.descriptionWe develop eigenvalue estimates for the Laplacians on discrete and metric graphs using different types of boundary conditions at the vertices of the metric graph. Via an explicit correspondence of the equilateral metric and discrete graph spectrum (also in the ``exceptional'' values of the metric graph corresponding to the Dirichlet spectrum) we carry over these estimates from the metric graph Laplacian to the discrete case. We apply the results to covering graphs and present examples where the covering graph Laplacians have spectral gaps.
dc.description32 pages, 6 figures
dc.identifierhttps://arxiv.org/abs/0804.1076
dc.identifierhttp://arxiv.org/abs/0804.1076
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/158253
dc.subjectSpectral Theory
dc.subjectMathematical Physics
dc.subjectCombinatorics
dc.subjectFunctional Analysis
dc.titleEigenvalue bracketing for discrete and metric graphs
dc.typetext

Files

Collections

arXiv