Gespeichert in:
| Hauptverfasser: | , , , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2024
|
| Schlagworte: | |
| Online-Zugang: | https://arxiv.org/abs/2410.22632 |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866909371788689408 |
|---|---|
| author | Lin, Huiqiu Liu, Lianping You, Zhe Zhao, Da |
| author_facet | Lin, Huiqiu Liu, Lianping You, Zhe Zhao, Da |
| contents | Let $Δ$ and $B$ be the maximum vertex degree and a subset of vertices in a graph $G$ respectively. In this paper, we study the first (non-trivial) Steklov eigenvalue $σ_2$ of $G$ with boundary $B$. Using metrical deformation via flows, we first show that $σ_2 = \mathcal{O}\left(\frac{Δ(g+1)^3}{|B|}\right)$ for graphs of orientable genus $g$ if $|B| \geq \max\{3 \sqrt{g},|V|^{\frac{1}{4} + ε}, 9\}$ for some $ε> 0$. This can be seen as a discrete analogue of Karpukhin's bound. Secondly, we prove that $σ_2 \leq \frac{8Δ+4X}{|B|}$ based on planar crossing number $X$. Thirdly, we show that $σ_2 \leq \frac{|B|}{|B|-1} \cdot δ_B$, where $δ_B$ denotes the minimum degree for boundary vertices in $B$. At last, we compare several upper bounds on Laplacian eigenvalues and Steklov eigenvalues. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2410_22632 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Upper bounds of Steklov eigenvalues on graphs Lin, Huiqiu Liu, Lianping You, Zhe Zhao, Da Combinatorics Let $Δ$ and $B$ be the maximum vertex degree and a subset of vertices in a graph $G$ respectively. In this paper, we study the first (non-trivial) Steklov eigenvalue $σ_2$ of $G$ with boundary $B$. Using metrical deformation via flows, we first show that $σ_2 = \mathcal{O}\left(\frac{Δ(g+1)^3}{|B|}\right)$ for graphs of orientable genus $g$ if $|B| \geq \max\{3 \sqrt{g},|V|^{\frac{1}{4} + ε}, 9\}$ for some $ε> 0$. This can be seen as a discrete analogue of Karpukhin's bound. Secondly, we prove that $σ_2 \leq \frac{8Δ+4X}{|B|}$ based on planar crossing number $X$. Thirdly, we show that $σ_2 \leq \frac{|B|}{|B|-1} \cdot δ_B$, where $δ_B$ denotes the minimum degree for boundary vertices in $B$. At last, we compare several upper bounds on Laplacian eigenvalues and Steklov eigenvalues. |
| title | Upper bounds of Steklov eigenvalues on graphs |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2410.22632 |