Upper bounds of Steklov eigenvalues on graphs (Q6858699)

The purpose of the authors is to show that the first Steklov eigenvalue \(\sigma_2\), of a graph \((G,B)\) such that \(B\) is the set of boundary vertices in the set of vertices \(V\), has three expressions. Concerning the first expression, they state that \(\displaystyle\sigma_2\le \left(\frac{Dg^3}{|B|}\right)\) for an orientable graph with a positive genus \(g\) and when \(|B|\ge \max\left(3\sqrt{g},|V|^{\varepsilon+1/4}, (9\sqrt{g})^{1/2+1/(8\varepsilon)}\right)\) for some \(\varepsilon>0\), and \(D\) is the maximum vertex degree. Apropos of the second expression, they assume that either \(|B|\ge 2\) or \(|B|\ge 5\) and state that \(\displaystyle\sigma_2\le \frac{8D+4X}{|B|}\) such that \(X\) is the smallest number of pairwise crossings of edges among drawings of \((G,B)\) in the plane. On the third expression of \(\sigma_2\), they state that \(\displaystyle\sigma_2\le \frac{|B|\delta_B}{|B|-1}\) where \(\delta_B\) is the minimum degree for boundary vertices in \(B\) and \(|B|\ge 2\).