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

Motivated by the connection between the first eigenvalue of the Dirichlet-Laplacian and the torsional rigidity, the aim of this paper is to find a physically coherent and mathematically interesting new concept for boundary torsional…

We consider the question of giving an upper bound for the first nontrivial eigenvalue of the Wentzell-Laplace operator of a domain $\Omega$, involving only geometrical informations. We provide such an upper bound, by generalizing Brock's…

In this paper, we consider the bounds for the largest eigenvalue and the sum of the $k$ largest Laplacian eigenvalues of signed graphs. Firstly, we give an upper bound on the largest eigenvalue of the adjacency matrix of a signed graph and…

Let $G$ be a graph of order $n$, and let $A(G)$ and $D(G)$ be the adjacency matrix and the degree matrix of $G$ respectively. Define the convex linear combinations $A_\alpha (G)$ of $A (G)$ and $D (G) $ by $$A_\alpha (G)=\alpha…

In this paper, we address the problem of maximizing the Steklov eigenvalues with a diameter constraint. We provide an estimate of the Steklov eigenvalues for a convex domain in terms of its diameter and volume and we show the existence of…

We show that for every $n$-vertex graph with at least one edge, its treewidth is greater than or equal to $n \lambda_{2} / (\Delta + \lambda_{2}) - 1$, where $\Delta$ and $\lambda_{2}$ are the maximum degree and the second smallest…

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…

We obtain upper bounds for the Steklov eigenvalues $\sigma_k(M)$ of a smooth, compact, connected, $n$-dimensional submanifold $M$ of Euclidean space with boundary $\Sigma$ that involve the intersection indices of $M$ and of $\Sigma$. One of…

Let $spex(n,H_{minor})$ denote the maximum spectral radius of $n$-vertex $H$-minor free graphs. The problem on determining this extremal value can be dated back to the early 1990s. Up to now, it has been solved for $n$ sufficiently large…

Let $G$ be a graph with degree sequence $d_1\geq \ldots \geq d_n$. Slater proposed $s\ell(G)=\min\{ s: (d_1+1)+\cdots+(d_s+1)\geq n\}$ as a lower bound on the domination number $\gamma(G)$ of $G$. We show that deciding the equality of…

Let $G$ be a graph. Its laplacian matrix $L(G)$ is positive and we consider eigenvectors of its first non-null eigenvalue that are called Fiedler vector. They have been intensively used in spectral partitioning problems due to their good…

For every real $0\leq \alpha \leq 1$, Nikiforov defined the $A_{\alpha}$-matrix of a graph $G$ as $A_{\alpha}(G)=\alpha D(G)+(1-\alpha)A(G)$, where $A(G)$ and $D(G)$ are the adjacency matrix and the degree diagonal matrix of a graph $G$,…

Caro, Davila, and Pepper (arXiv:1909.09093) recently proved $\delta(G) \alpha(G)\leq \Delta(G) \mu(G)$ for every graph $G$ with minimum degree $\delta(G)$, maximum degree $\Delta(G)$, independence number $\alpha(G)$, and matching number…

In this paper, we analyze an optimization problem for the first (nonlinear) Steklov eigenvalue plus a boundary potential with respect to the potential function which is assumed to be uniformly bounded and with fixed $L^1$-norm.

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 develop a nonlinear spectral graph theory, in which the Laplace operator is replaced by the 1-Laplacian ?$\Delta_1$. The eigenvalue problem is to solve a nonlinear system involving a set valued function. In the study, we investigate the…

We prove that every graph with average degree $d$ and smallest adjacency eigenvalue $|\lambda_n|\leq d^{\gamma}$ contains a clique of size $d^{1-O(\gamma)}$. A simple corollary of this yields the first polynomial bound for Chowla's cosine…

We consider Steklov eigenvalues of nearly hyperspherical domains in $\mathbb{R}^{d + 1}$ with $d\ge 3$. In previous work, treating such domains as perturbations of the ball, we proved that the Steklov eigenvalues are analytic functions of…

In this paper we prove that given a volume, among all domains with smooth boundary in rank-1 symmetric spaces of noncompact type, geodesic balls maximizes the first nonzero Steklov eigenvalue. We also prove a comparison result for the first…

Let $D(G)$ denote the distance matrix of a connected graph $G$ with $n$ vertices. The distance spectral gap of a graph $G$ is defined as $\delta_{D^G} = \rho_1 - \rho_2$, where $\rho_1$ and $\rho_2$ represent the largest and second largest…