The first Steklov eigenvalue bound for graphs of positive genus

Abstract

Let $G$ be a graph of genus $g$ with boundary $\hat{I}´\hat{I}\text{c◯}$. For $g=0$, Lin and Zhao [J. Lond. Math. Soc. 112 (2025), Paper No. e70238] proved an upper bound for the first (non-trivial) Steklov eigenvalue of $(G,\hat{I}´\hat{I}\text{c◯})$, and they posed the problem of determining a corresponding bound for graphs of genus $g>0$. In this paper, we prove an $O\left(\frac{g}{|\hat{I}´\hat{I}\text{c◯}|}\right)$ bound for a bounded-degree graph of positive genus $g$. Our result can be regarded as a discrete analogue of Kokarev's bound [Adv. Math. 258 (2014), 191-239], up to a constant factor.

17pages