Strong Isoperimetric Inequality for Tessellating Quantum Graphs
classification
🧮 math.MG
math.SP
keywords
graphsisoperimetrictessellatingmetricanaloguecombinatorialconstantconstants
read the original abstract
We investigate isoperimetric constants of infinite tessellating metric graphs. We introduce a curvature-like quantity, which plays the role of a metric graph analogue of discrete curvature notions for combinatorial tessellating graphs. We then prove a lower estimate and a criterium for positivity of the isoperimetric constant.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.