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

We give a new estimate on the lower bound for the first Dirichlet eigenvalue for a compact manifold with positive Ricci curvature in terms of the in-diameter and the lower bound of the Ricci curvature. The result improves the previous…

In this paper, we obtain the sharp upper and lower bounds for the spectral radius of a nonnegative irreducible matrix. We also apply these bounds to various matrices associated with a graph or a digraph, obtain some new results or known…

Let $G = (V, E)$ be a graph. The first Zagreb index of a graph $G$ is defined as $\sum_{u \in V} d^2(u)$, where $d(u)$ is the degree of vertex $u$ in $G$. Using the P\'{o}lya-Szeg\H{o} inequality, we in this paper present the first Zagreb…

We provide upper and lower bounds on the smallest eigenvalue of grounded Laplacian matrices (which are matrices obtained by removing certain rows and columns of the Laplacian matrix of a given graph). The gap between the upper and lower…

In this short article, we consider a problem about $2$-partition of the vertices of a graph. If a graph admits such a partition into some 'small' graphs, then the number of edges cross an arbitrary cut of the graph $e(S,S^{c})$ has a nice…

In this paper we obtain several results concerning the optimization of higher Steklov eigenvalues both in two and higher dimensional cases. We first show that the normalized (by boundary length) $k$-th Steklov eigenvalue on the disk is not…

We consider several semidefinite programming relaxations for the max-$k$-cut problem, with increasing complexity. The optimal solution of the weakest presented semidefinite programming relaxation has a closed form expression that includes…

We present monotonicity inequalities for certain functions involving eigenvalues of $p$-Laplacians on signed graphs with respect to $p$. Inspired by such monotonicity, we propose new spectrum-based graph invariants, called (variational)…

We study the limit of first eigenfunctions of (discrete) $p$-Laplacian on a finite subset of a graph with Dirichlet boundary condition, as $p\to 1.$ We prove that up to a subsequence, they converge to a summation of characteristic functions…

We study the first nonzero Steklov eigenvalue $\lambda_2(T,\delta\Omega)$ of the Dirichlet-to-Neumann operator on a finite tree $T$ with leaf boundary $\delta\Omega$, under a constraint on the diameter $D$. He and Hua [Calc. Var. PDE, 2022]…

Along the line of the Yang Conjecture, we give a new estimate on the lower bound of the first non-zero eigenvalue of a closed Riemannian manifold with negative lower bound of Ricci curvature in terms of the in-diameter and the lower bound…

Let $n_g(k)$ denote the smallest order of a $k$-chromatic graph of girth at least $g$. We consider the problem of determining $n_g(k)$ for small values of $k$ and $g$. After giving an overview of what is known about $n_g(k)$, we provide…

We give an upper bound on the smallest eigenvalue of the adjacency matrix of graphs with no p-cliques.

Urschel introduced a notion of nodal partitioning to prove an upper bound on the number of nodal decomposition of discrete Laplacian eigenvectors. The result is an analogue to the well-known Courant's nodal domain theorem on continuous…

We present upper and lower bounds for Steklov eigenvalues for domains in $\mathbb{R}^{N+1}$ with $C^2$ boundary compatible with the Weyl asymptotics. In particular, we obtain sharp upper bounds on Riesz-means and the trace of corresponding…

We establish mild conditions under which a possibly irregular, sparse graph $G$ has "many" strong orientations. Given a graph $G$ on $n$ vertices, orient each edge in either direction with probability $1/2$ independently. We show that if…

We prove Reilly-type upper bounds for the first non-zero eigenvalue of the Steklov problem associated with the $p$-Laplace operator on submanifolds of manifolds with sectional curvature bounded form above by a non-negative constant.

A basic fact in algebraic graph theory is that the number of connected components in an undirected graph is equal to the multiplicity of the eigenvalue 1 in the normalized adjacency matrix of the graph. In particular, the graph is…

This work is devoted to lower bounds on independence numbers of distance graphs with vertices in $\{-1,0,1\}^n$. The asymptotic case is studied, yielding new results over a broad range of parameters. Numerical results are presented,…

In 1995, Brouwer proved that the toughness of a connected $k$-regular graph $G$ is at least $k/\lambda-2$, where $\lambda$ is the maximum absolute value of the non-trivial eigenvalues of $G$. Brouwer conjectured that one can improve this…