Related papers: Lower bounds for the first eigenvalue of the Stekl…

In this paper, we study (zero) forcing sets which induce connected subgraphs of a graph. The minimum cardinality of such a set is called the connected forcing number of the graph. We provide sharp upper and lower bounds on the connected…

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…

In this paper, we initiate the study of the inverse eigenvalue problem for probe graphs. A probe graph is a graph whose vertices are partitioned into probe vertices and non-probe vertices such that the non-probe vertices form an independent…

Given a closed Riemannian manifold $M$ and $b\geq2$ closed connected submanifolds $N_j\subset M$ of codimension at least $2$, we prove that the first non-zero eigenvalue of the domain $\Omega_\varepsilon\subset M$ obtained by removing the…

We study bounds on the Riesz means of the mixed Steklov-Neumann and Steklov-Dirichlet eigenvalue problem on a bounded domain $\Omega$ in $\mathbb{R}^n$. The Steklov-Neumann eigenvalue problem is also called the sloshing problem. We obtain…

In recent years, eigenvalue optimization problems have received a lot of attention, in particular, due to their connection with the theory of minimal surfaces. In the present paper we prove that on any orientable surface there exists a…

First we establish a weighted Reilly formula for differential forms on a smooth compact oriented Riemannian manifold with boundary. Then we give two applications of this formula when the manifold satisfies certain geometric conditions. One…

The \emph{eccentricity} of a vertex $u$ in a graph $G$, denoted by $e_G(u)$, is the maximum distance from $u$ to other vertices in $G$. We study extremal problems for the average eccentricity and the first and second Zagreb eccentricity…

We define a new graph invariant called the scramble number. We show that the scramble number of a graph is a lower bound for the gonality and an upper bound for the treewidth. Unlike the treewidth, the scramble number is not minor monotone,…

This work investigates upper bounds for the spectrum of the Steklov-type operator on Riemannian manifolds with boundary. We extend the Fraser-Schoen estimate for the first positive Steklov eigenvalue to higher Steklov eigenvalues, in terms…

In his survey "Beyond graph energy: Norms of graphs and matrices" (2016), Nikiforov proposed two problems concerning characterizing the graphs that attain equality in a lower bound and in a upper bound for the energy of a graph,…

Koolen et al. showed that if a connected graph with smallest eigenvalue at least $-3$ has large minimal valency, then it is $2$-integrable. In this paper, we will prove that a lower bound for the minimal valency is 166.

For a graph $G$, we associate a family of real symmetric matrices, $S(G)$, where for any $A\in S(G)$, the location of the nonzero off-diagonal entries of $A$ are governed by the adjacency structure of $G$. Let $q(G)$ be the minimum number…

We consider the dependence of non-zero Steklov eigenvalues on smooth perturbations of the domain boundary. We prove that these eigenvalues are generically simple under such boundary perturbations. This result complements our previous work…

This paper studies eigenvalues of some Steklov problems. Among other things, we show the following sharp estimtes. Let $\Omega$ be a bounded smooth domain in an $n(\geq 2)$-dimensional Hadamard manifold an let $0=\lambda_0 < \lambda_1\leq…

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.…

We study a Dirichlet-to-Neumann eigenvalue problem for differential forms on a compact Riemannian manifold with smooth boundary. This problem is a natural generalization of the classical Steklov problem on functions. We derive a number of…

This paper investigates the asymptotic nature of graph spectra when some edges of a graph are subdivided sufficiently many times. In the special case where all edges of a graph are subdivided, we find the exact limits of the $k$-th largest…

We give an upper bound on the number of perfect matchings in an undirected simple graph $G$ with an even number of vertices, in terms of the degrees of all the vertices in $G$. This bound is sharp if $G$ is a union of complete bipartite…

In tensor eigenvalue problems, one is likely to be more interested in H-eigenvalues of tensors. The largest H-eigenvalue of a nonnegative tensor or of a uniform hypergraph is the spectral radius of the tensor or of the uniform hypergraph.…