Speaker: Chengjie YU (Shantou University)

Time： March 23, 16:00-17:00

Place： 腾讯会议：530-921-280 密码 202203

Title： Minimal Steklov Eigenvalues on Combinatorial Graphs

Abstract： In this talk, we will present some details of our recent work on extending Jeol Friedman's theory on nodal domains for Laplacian eigenfunctions on combinatorial graphs to Steklov eigenfunctions and applying it to solve an minimum problem on Steklov eigenvalues for combinatorial graphs which is also an extension of Friedman's theory on solving a similar minimum problem on Laplacian eigenvalues. This talk is based on a joint work with Yingtao Yu.