相关论文: A Lichnerowicz-type estimate for Steklov eigenvalu…
The inertia bound, introduced by Cvetkovi\'c in 1971, is a fundamental result in spectral graph theory that provides an upper bound for the independence number of a graph in terms of spectral information about a weighted adjacency matrix of…
We give inequalities relating the eigenvalues of the adjacency matrix and the Laplacian of a graph, and its minimum and maximum degrees. The results are applied to derive new conditions for quasi-randomness of graphs.
We consider Schr\"odinger operators on sparse graphs. The geometric definition of sparseness turn out to be equivalent to a functional inequality for the Laplacian. In consequence, sparseness has in turn strong spectral and functional…
Trees can be regarded as discrete analogue of Hadamard manifolds, namely simply-connected Riemannian manifolds of non-positive sectional curvature. In this paper, we compare the first (non-trivial) Steklov eigenvalue and algebraic…
We study the eigenvalues of the Laplacian on ellipsoids that are obtained as perturbations of the standard Euclidean unit sphere in dimension two. A comparison of these eigenvalues with those of the standard Euclidean unit sphere is…
We present some open problems and obtain some partial results for spectral optimization problems involving measure, torsional rigidity and first Dirichlet eigenvalue.
In this paper, we first construct a sequence of hyperbolic surfaces with connected geodesic boundary such that the first normalized Steklov eigenvalue $\tilde{\sigma}_1$ tends to infinity. We then prove that as $g\rightarrow \infty$, a…
Eigenvalue interlacing is a versatile technique for deriving results in algebraic combinatorics. In particular, it has been successfully used for proving a number of results about the relation between the (adjacency matrix or Laplacian)…
In this note we study the eigenvalue growth of infinite graphs with discrete spectrum. We assume that the corresponding Dirichlet forms satisfy certain Sobolev-type inequalities and that the total measure is finite. In this sense, the…
The relationships between eigenvalues and eigenvectors of a product graph and those of its factor graphs have been known for the standard products, while characterization of Laplacian eigenvalues and eigenvectors of the Kronecker product of…
We obtain upper and lower bounds for Steklov eigenvalues of submanifolds with prescribed boundary in Euclidean space. A very general upper bound is proved, which depends only on the geometry of the fixed boundary and on the measure of the…
Eigenvector centrality is one of the outstanding measures of central tendency in graph theory. In this paper we consider the problem of calculating eigenvector centrality of graph partitioned into components and how this partitioning can be…
For a connected graph $G$ with order $n$ and an integer $k\geq 1$, we denote by $$S_k(D(G))=\lambda_1(D(G))+\cdots+\lambda_k(D(G))$$ the sum of $k$ largest distance eigenvalues of $G$. In this paper, we consider the sharp upper bound and…
It is known that, for Dirac operators on Riemann surfaces twisted by line bundles with Hermitian-Einstein connections, it is possible to obtain estimates for the first eigenvalue in terms of the topology of the twisting bundle \cite{JL2}.…
In this paper, we investigate the eigenvalues of the Laplacian matrix of the "graph of graphs", in which cubic graphs of order n are joined together using Whitehead moves. Our work follows recent results from arXiv:2303.13923 , which…
In this paper, we derive an upper bound for higher order eigenvalues of the normalized Laplace operator associated with a symmetric finite graph in terms of lower order eigenvalues.
We prove decay estimates for generalized eigenfunctions of discrete Schr\"odinger operators on weighted infinite graphs in the spirit of Agmon.
New estimates for eigenvalues of non-self-adjoint multi-dimensional Schr\"{o}dinger operators are obtained in terms of $L_{p}$-norms of the potentials. The results extend and improve those obtained previously. In particular, diverse…
In this article, we consider the nonlinear Steklov eigenvalue problem in outward cuspidal domains. Using the compactness of the weighted trace embedding we obtain the variational characterization of the first non-trivial eigenvalue and…
In this article, we establish some bounds involving the largest two distance Pareto eigenvalues of a connected graph. Also we characterize all possible values for smallest six distance Pareto eigenvalues of a connected graph.