Minimal Steklov eigenvalues on combinatorial graphs

Abstract

In this paper, we study extremal problems of Steklov eigenvalues on combinatorial graphs by extending Friedman's theory of nodal domains for Laplacian eigenfunctions to Steklov eigenfunctions.