Related papers: Minimal Steklov eigenvalues on combinatorial graph…
In this paper, we investigate some properties of the Perron vector of connected graphs. These results are used to characterize that all extremal connected graphs with having the minimum (maximum) spectra radius among all connected graphs of…
In [Camano, Lackner, Monk, SIAM J. Math. Anal., Vol. 49, No. 6, pp. 4376-4401 (2017)] it was suggested to use Stekloff eigenvalues for Maxwell equations as target signature for nondestructive testing via inverse scattering. The authors…
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…
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…
We prove a minimum degree version of the Kruskal--Katona theorem: given $d\ge 1/4$ and a triple system $F$ on $n$ vertices with minimum degree at least $d\binom n2$, we obtain asymptotically tight lower bounds for the size of its shadow.…
The integral circulant graph $ICG_n (D)$ has the vertex set $Z_n = \{0, 1, 2, \ldots, n - 1\}$, where vertices $a$ and $b$ are adjacent if $\gcd(a-b,n)\in D$, with $D \subseteq \{d : d \mid n,\ 1\leq d<n\}$. In this paper, we establish that…
We consider the spectral structure of indefinite second order boundary-value problems on graphs. A variational formulation for such boundary-value problems on graphs is given and we obtain both full and half-range completeness results. This…
We obtain a complete asymptotic expansion for the eigenvalues of the Dirichlet-to-Neumann maps associated with Schr\"odinger operators on compact Riemannian surfaces with boundary. For the zero potential, we recover the well-known spectral…
Inspired by notorious combinatorial optimization problems on graphs, in this paper we consider a series of related problems defined using a metric space and topology determined by a graph. Particularly, we present the Independent Set,…
We show that the discrete versions of the systolic inequality that estimate the number of vertices of a simplicial complex from below have substantial applications to graphs, the one-dimensional simplicial complexes. Almost directly they…
In this paper, we study the existence of extremal functions of the discrete Sobolev inequality and Hardy-Littlewood-Sobolev inequality on lattice graphs. We introduce the discrete Concentration-Compactness principle, and prove the existence…
The aim of this article is to provide a simple and unified way to obtain the sharp upper bounds of nodal sets of eigenfunctions for different types of eigenvalue problems on real analytic domains. The examples include biharmonic Steklov…
In this paper extremal problems for uniform hypergraphs are studied in the general setting of hereditary properties. It turns out that extremal problems about edges are particular cases of a general analyic problem about a recently…
We analyse approximation algorithms (greedy heuristics) for the classical domination number and two multiple domination numbers in simple graphs. First, we present a short self-contained proof of the known result that the minimum domination…
In this paper, we obtain some comparisons of the Dirichlet, Neumann and Laplacian eigenvalues on graphs. We also discuss their rigidities and some of their applications including some Lichnerowicz-type, Fiedler-type and Friedman-type…
We study the asymptotic Dirichlet problem for $f$-minimal graphs in Cartan-Hadamard manifolds $M$. $f$-minimal hypersurfaces are natural generalizations of self-shrinkers which play a crucial role in the study of mean curvature flow. In the…
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…
We develop a numerical method for solving shape optimization of functionals involving Steklov eigenvalues and apply it to the problem of maximization of the $k$-th Steklov eigenvalue, under volume constraint. A similar study in the planar…
We consider Steklov eigenvalues of nearly circular domains in $\R^{2}$ of fixed unitary area. In \cite{viator2018}, the authors treated such domains as perturbations of the disk, and they computed the first-order term of the asymptotic…
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…