相关论文: The first Steklov eigenvalue of planar graphs and …

For any $\alpha\in (0,1)$ and any $n^{\alpha}\leq d\leq n/2$, we show that $\lambda(G)\leq C_\alpha \sqrt{d}$ with probability at least $1-\frac{1}{n}$, where $G$ is the uniform random $d$-regular graph on $n$ vertices, $\lambda(G)$ denotes…

Let $G$ be a graph with $n$ vertices and $m$ edges. The spectral radius $\rho(G)$ of $G$ is the largest eigenvalue of the adjacency matrix of $G$. As is well known, $\rho(G)\geq\frac{2m}{n}$ with equality if and only if $G$ is regular. To…

In this note we present upper bounds for the variational eigenvalues of the Steklov $p$-Laplacian on domains of $\mathbb R^n$, $n\geq 2$. We show that for $1<p\leq n$ the variational eigenvalues $\sigma_{p,k}$ are bounded above in terms of…

In this article, we study the mixed Steklov--Neumann eigenvalue problem on doubly connected domains. First, we show that among all doubly connected domains in $\mathbb{R}^n$ of the form $B_{R_2}\setminus \overline{B_{R_1}}$, where $B_{R_1}$…

In 2002, Nikiforov proved that for an $n$-vertex graph $G$ with clique number $\omega$ and edge number $m$, the spectral radius $\lambda(G)$ satisfies $\lambda (G) \leq \sqrt{2(1 - 1/\omega) m}$, which confirmed a conjecture implicitly…

Let $G$ be a strongly connected digraph with $n$ vertices and $m$ arcs. For any real $\alpha\in[0,1]$, the $A_\alpha$ matrix of a digraph $G$ is defined as $$A_\alpha(G)=\alpha D(G)+(1-\alpha)A(G),$$ where $A(G)$ is the adjacency matrix of…

In this paper, we deal with the Steklov-Dirichlet eigenvalue problem for the Laplacian in annular domains. More precisely, we consider $\Omega_r = \Omega_0 \setminus \overline{B}_r$, where $\Omega_0 \subset \mathbb{R}^n$, $n \geq 2$, is an…

In this paper, we obtain a comparison of Steklov eigenvalues and Laplacian eigenvalues on graphs and discuss its rigidity. As applications of the comparison of eigenvalues, we obtain Lichnerowicz-type estimates and some combinatorial…

We study nodal sets of Steklov eigenfunctions in a bounded domain with $\mathcal{C}^2$ boundary. Our first result is a lower bound for the Hausdorff measure of the nodal set: we show that for $u_{\lambda}$ a Steklov eigenfunction, with…

For given $\Delta>0$ and $0<\lambda<3/\sqrt{2}$, we show that the maximum multiplicity that $\lambda$ can appear as the second largest eigenvalue of a connected graph with maximum degree at most $\Delta$ is $O_{\Delta,\lambda}(1)$. This…

In 1993 Hong asked what are the best bounds on the $k$'th largest eigenvalue $\lambda_{k}(G)$ of a graph $G$ of order $n$. This challenging question has never been tackled for any $2<k<n$. In the present paper tight bounds are obtained for…

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…

Let G be a graph with adjacency matrix A(G) and degree diagonal matrix D(G). In 2017, Nikiforov [1] defined the matrix Aalpha(G), as a convex combination of A(G) and D(G), the following way, Aalpha(G) = alpha A(G) + (1 - alpha)D(G), where…

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 this paper we prove the existence of a maximum for the first Steklov-Dirichlet eigenvalue in the class of convex sets with a fixed spherical hole under volume constraint. More precisely, if $\Omega=\Omega_0 \setminus \bar{B}_{R_1}$,…

The "slope-number" of a graph $G$ is the minimum number of distinct edge slopes in a straight-line drawing of $G$ in the plane. We prove that for $\Delta\geq5$ and all large $n$, there is a $\Delta$-regular $n$-vertex graph with…

We establish a new lower bound for the first non-zero Steklov eigenvalue of a compact Riemannian manifold with non-negative Ricci curvature and (strictly) convex boundary. Related results are also obtained under weaker geometric hypotheses.

We give an upper bound on the maximal eigenvalue of the adjacency matrix of a connected graph in terms of its maximum degree, diameter and order. This bound is best possible up to a constant factor and improves prevoius results of…

The work in this thesis concerns the investigation of eigenvalues of the Laplacian matrix, normalized Laplacian matrix, signless Laplacian matrix and distance signless Laplacian matrix of graphs. In Chapter 1, we present a brief…

Let $G$ be a finite group, and let ${\rm{cd}}(G)$ denote the set of degrees of the irreducible complex characters of $G$. The degree graph $\Delta(G)$ of $G$ is defined as the simple undirected graph whose vertex set ${\rm{V}}(G)$ consists…