Minimal Steklov eigenvalues on combinatorial graphs
arxiv（2022）
摘要
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.
更多查看译文
AI 理解论文
溯源树
样例
生成溯源树，研究论文发展脉络
Chat Paper
正在生成论文摘要