相关论文: On strong nodal domains for eigenfunctions of Hamm…

For a graph $G$ of order $n$, let $$ \lambda_1(G)\ge \cdots \ge \lambda_n(G) $$ be the eigenvalues of its adjacency matrix. We prove that every graph $G$ on $n\ge 3$ vertices satisfies $$ \lambda_3(G)\le \frac{n}{3}-1, $$ thereby solving a…

We study the existence of Neumann eigenfunctions which do not change sign on the boundary of some special domains. We show that eigenfunctions which are strictly positive on the boundary exist on regular polygons with at least 5 sides,…

The paper addresses the the number of nodal domains for eigenfunctions of Schr\"{o}dinger operators with Dirichlet boundary conditions in bounded domains. In dimension one, the $n$th eigenfunction has $n$ nodal domains. The Courant Theorem…

We use two variational techniques to prove upper bounds for sums of the lowest several eigenvalues of matrices associated with finite, simple, combinatorial graphs. These include estimates for the adjacency matrix of a graph and for both…

The set $S_{i,n}=\{0,1,2,\ldots,n-1,n\}\setminus\{i\}$, $1\leqslant i\leqslant n$ is called Laplacian realizable if there exists an undirected simple graph whose Laplacian spectrum is $S_{i,n}$. The existence of such graphs was established…

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…

We show the existence of planar domains with one hole for which the first non-trivial Neumann eigenfunction has a closed nodal line fully contained inside the domain. This is optimal, as it is known since Pleijel's 1956 result that the…

We study topological lower bounds on the number of small Laplacian eigenvalues on hyperbolic surfaces. We show there exist constants $a,b>0$ such that when $(g+1)<a\frac{n}{\log n}$, any hyperbolic surface of genus-$g$ with $n$ cusps has at…

Let $ \Omega \subset R^2$ be a bounded piecewise smooth domain and $\phi_\lambda$ be a Neumann (or Dirichlet) eigenfunction with eigenvalue $\lambda^2$ and nodal set ${ N}_{\phi_{\lambda}} = {x \in \Omega; \phi_{\lambda}(x) = 0}.$ Let $H…

We study the nodal sets of eigenfunctions of the Laplacian on the standard d-dimensional flat torus. The question we address is: Can a fixed hypersurface lie on the nodal sets of eigenfunctions with arbitrarily large eigenvalue? In…

We study the nodal sets of Neumann Laplace eigenfunctions in a bounded domain with $\mathcal{C}^{1,1}$ boundary. We show that for $u_\lambda$ such that $\Delta u_\lambda + \lambda u_\lambda = 0 $ with the Neumann boundary condition…

Consider an eigenvector of the adjacency matrix of a G(n, p) graph. A nodal domain is a connected component of the set of vertices where this eigenvector has a constant sign. It is known that with high probability, there are exactly two…

Let $\alpha'$ and $\mu_i$ denote the matching number of a non-empty simple graph $G$ with $n$ vertices and the $i$-th smallest eigenvalue of its Laplacian matrix, respectively. In this paper, we prove a tight lower bound $$\alpha' \ge…

The sum of the first $n \geq 1$ eigenvalues of the Laplacian is shown to be maximal among simplexes for the regular simplex (the regular tetrahedron, in three dimensions), maximal among parallelepipeds for the hypercube, and maximal among…

In this thesis, we study Laplacian eigenfunctions on metric graphs, also known as quantum graphs. We restrict the discussion to standard quantum graphs. These are finite connected metric graphs with functions that satisfy Neumann vertex…

Let $\calM_1$ and $\calM_2$ denote two compact hyperbolic manifolds. Assume that the multiplicities of eigenvalues of the Laplacian acting on $L^2(\calM_1)$ and $L^2(\calM_2)$ (respectively, multiplicities of lengths of closed geodesics in…

The 2-dimensional Hamming graph H(2,n) consists of the $n^2$ vertices $(i,j)$, $1\leq i,j\leq n$, two vertices being adjacent when they share a common coordinate. We examine random subgraphs of H(2,n) in percolation with edge probability…

An odd $[1,b]$-factor of a graph $G$ is a spanning subgraph $H$ such that for each vertex $v \in V(G)$, $d_H(v)$ is odd and $1\le d_H(v) \le b$. Let $\lambda_3(G)$ be the third largest eigenvalue of the adjacency matrix of $G$. For positive…

Ahanjideh, Akbari, Fakharan and Trevisan proposed a conjecture in [Linear Algebra Appl. 632 (2022) 1--14] on the distribution of the Laplacian eigenvalues of graphs: for any connected graph of order $n$ with diameter $d\ge 2$ that is not a…

We prove sharp upper bounds for the first and second non-trivial eigenvalues of the Neumann Laplacian in two classes of domains: parallelograms and domains of constant width. This gives in particular a new proof of an isoperimetric…