Related papers: Upper bounds for the Steklov eigenvalues on trees

In this work a composition-decomposition technique is presented that correlates tree eigenvectors with certain eigenvectors of an associated so-called skeleton forest. In particular, the matching properties of a skeleton determine the…

We prove the Erd\H os--S\'os conjecture for trees with bounded maximum degree and large dense host graphs. As a corollary, we obtain an upper bound on the multicolour Ramsey number of large trees whose maximum degree is bounded by a…

We study the following class of Steklov eigenvalue problems: \[ \nabla \cdot \bigl( w \nabla u \bigr) = 0 \quad \text{in } \Omega, \qquad \frac{\partial u}{\partial \nu} = \gamma v u \quad \text{on } \partial \Omega, \] where $w$ and $v$…

We consider an eigenvalue problem for the biharmonic operator with Steklov-type boundary conditions. We obtain it as a limiting Neumann problem for the biharmonic operator in a process of mass concentration at the boundary. We study the…

We prove a Cheeger inequality for the first positive Steklov eigenvalue. It involves two isoperimetric constants.

A proof for the lower bound is provided for the smallest eigenvalue of finite element equations with arbitrary conforming simplicial meshes. The bound has a similar form as the one by Graham and McLean [SIAM J. Numer. Anal., 44 (2006), pp.…

Let $(\Omega^{n+1}, g)$ be an $(n+1)$-dimensional smooth compact connected Riemannian manifold with smooth boundary $\Sigma$, satisfying that ${\text{Ric}_{\Omega}}\ge 0$ and $\Sigma$ is strictly convex, more precisely, its second…

Let $M^n=[0,R)\times \mathbb{S}^{n-1}$ be an $n$-dimensional ($n\geq 2$) smooth Riemannian manifold equipped with the warped product metric $g=dr^2+h^2(r)g_{\mathbb{S}^{n-1}}$ and diffeomorphic to a Euclidean ball. Assume that $M$ has…

The Wiener index is maximized over the set of trees with the given vertex weight and degree sequences. This model covers the traditional "unweighed" Wiener index, the terminal Wiener index, and the vertex distance index. It is shown that…

We prove tight bounds on the site percolation threshold for $k$-uniform hypergraphs of maximum degree $\Delta$ and for $k$-uniform hypergraphs of maximum degree $\Delta$ in which any pair of edges overlaps in at most $r$ vertices. The…

We give characterizations for the existence of traces for first order Sobolev spaces defined on regular trees.

The Faber-Krahn inequality states that the first Dirichlet eigenvalue among all bounded domains is no less than a Euclidean ball with the same volume in $\mathbb{R}^n$ \cite{Chavel FB}. B{\i}y{\i}ko\u{g}lu and Leydold (J. Comb. Theory, Ser.…

Let $\Omega$ be a compact surface with smooth boundary and the geodesic curvature $k_g \ge {c > 0}$ along $\partial \Omega$ for some constant $c \in \mathbb{R}$. We prove that, if the Gaussian curvature satisfies $K \ge -\alpha$ for a…

This paper investigates the spectral properties of two classes of elliptic problems characterized by mixed Steklov-Robin boundary conditions. Our main objective is to prove that, for a generic domain, all the eigenvalues are simple. This…

The eccentricity matrix $\varepsilon(G)$ of a graph $G$ is constructed from the distance matrix of $G$ by keeping only the largest distances for each row and each column. This matrix can be interpreted as the opposite of the adjacency…

In this article we study the homogenization rates of eigenvalues of a Steklov problem with rapidly oscillating periodic weight functions. The results are obtained via a careful study of oscillating functions on the boundary and a precise…

We establish a sharp lower bound on the first non-trivial eigenvalue of the Laplacian on a metric graph equipped with natural (i.e., continuity and Kirchhoff) vertex conditions in terms of the diameter and the total length of the graph.…

For a graph $G$, let $\lambda_1(G)$ and $\lambda_2(G)$ denote the largest and the second largest adjacency eigenvalue of $G$. The sum $\lambda_1(G) + \lambda_2(G)$ is called the \emph{spectral sum} of $G$. We investigate the spectral sum of…

The terminal Wiener index of a tree is the sum of distances for all pairs of pendent vertices, which recently arises in the study of phylogenetic tree reconstruction and the neighborhood of trees. This paper presents a sharp upper and lower…

We investigate the rank of the average mixing matrix of trees, with all eigenvalues distinct. The rank of the average mixing matrix of a tree on $n$ vertices with $n$ distinct eigenvalues is upper-bounded by $\frac{n}{2}$. Computations on…