English

Steklov flows on trees and applications

Spectral Theory 2022-09-30 v2 Combinatorics

Abstract

We introduce the Steklov flows on finite trees, i.e. the flows (or currents) associated with the Steklov problem. By constructing appropriate Steklov flows, we prove the monotonicity and rigidity of the first nonzero Steklov eigenvalues on trees: for finite trees \g1\g_1 and \g2,\g_2, the first nonzero Steklov eigenvalue of \g1\g_1 is greater than or equal to that of \g2\g_2, provided that \g1\g_1 is a subgraph of \g2.\g_2. Moreover, we give the sufficient and necessary condition in which the equality holds.

Keywords

Cite

@article{arxiv.2103.07696,
  title  = {Steklov flows on trees and applications},
  author = {Zunwu He and Bobo Hua},
  journal= {arXiv preprint arXiv:2103.07696},
  year   = {2022}
}

Comments

22 pages, 2 figures

R2 v1 2026-06-24T00:06:18.427Z