相关论文: Diameter vs Laplacian eigenvalue distribution

Let $G$ be a connected undirected graph with $n$, $n\ge 3$, vertices and $m$ edges. Denote by $\rho_1 \ge \rho_2 \ge \cdots > \rho_n =0$ the normalized Laplacian eigenvalues of $G$. Upper and lower bounds of $\rho_i$, $i=1,2,\ldots , n-1$,…

Let $G$ be a graph of order $n,$ and let $q_{1}(G) \geq ...\geq q_{n}(G) $ be the eigenvalues of the $Q$-matrix of $G$, also known as the signless Laplacian of $G.$ In this paper we give a necessary and sufficient condition for the equality…

We study the convergence of the graph Laplacian of a random geometric graph generated by an i.i.d. sample from a $m$-dimensional submanifold $M$ in $R^d$ as the sample size $n$ increases and the neighborhood size $h$ tends to zero. We show…

We consider the problem of minimising the $k$-th eigenvalue of the Laplacian with some prescribed boundary condition over collections of convex domains of prescribed perimeter or diameter. It is known that these minimisation problems are…

Let $G$ be a connected graph on $n$ vertices and let $D(G)$ and $D^{L}(G)$ be the distance and the distance Laplacian matrices associated with $G$. A graph $G$ is said to be $D$-integral (resp. $D^L$-integral) if all eigenvalues of $D(G)$…

In this paper we study the eigenvalues of the laplacian matrices of the cyclic graphs with one edge of weight $\alpha$ and the others of weight $1$. We denote by $n$ the order of the graph and suppose that $n$ tends to infinity. We notice…

We establish a sharp lower bound on the first non-trivial eigenvalue of the Laplacian on a metric graph equipped with natural (i.e., continuity and Kirchhoff) vertex conditions in terms of the diameter and the total length of the graph.…

The set $S_{\{i,j\}_{n}^{m}}=\{0,1,2,\ldots,m-1,m,m,m+1,\ldots,n-1,n\}\setminus\{i,j\},\quad 0<i<j\leqslant n$, is called Laplacian realizable if there exists a simple connected graph $G$ whose Laplacian spectrum is $S_{\{i,j\}_{n}^{m}}$.…

Let $G$ be an $n$-vertex graph with Laplacian eigenvalues $0=\lambda_1(G)\le \lambda_2(G)\le\cdots\le \lambda_n(G)$. Motivated by the Alon-Boppana bound and the Ramanujan phenomenon for regular graphs, Spielman conjectured that, for every…

Graphs with few distinct eigenvalues have been investigated extensively. In this paper, we focus on another relevant topic: characterizing graphs with some eigenvalue of large multiplicity. Specifically, the normalized Laplacian matrix of a…

Let $G$ be a simple graph with $n$ vertices and let $$C(G;x)=\sum_{k=0}^n(-1)^{n-k}c(G,k)x^k$$ denote the Laplacian characteristic polynomial of $G$. Then if the size $|E(G)|$ is large compared to the maximum degree $\Delta(G)$, Laplacian…

The Laplacian matrix of a simple graph is the difference of the diagonal matrix of vertex degree and the (0,1) adjacency matrix. In the past decades, the Laplacian spectrum has received much more and more attention, since it has been…

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…

For a graph $G$, let $\mathcal{S}(G)$ be the set consisting of Hermitian matrices whose graph is $G$. Denoted by $m_B(G,\lambda)$ the multiplicity of an eigenvalue $\lambda$ of $B(G)\in \mathcal{S}(G)$, we show that $m_B(G,\lambda)\le…

Let $G$ be a simple connected graph of order $n$ and $D(G)$ be the distance matrix of $G.$ Suppose that $\lambda_{1}(D(G))\geq\lambda_{2}(D(G))\geq\cdots\geq\lambda_{n}(D(G))$ are the distance spectrum of $G$. A graph $G$ is said to be…

The signless Laplacian matrix of a graph $G$ is given by $Q(G)=D(G)+A(G)$, where $D(G)$ is a diagonal matrix of vertex degrees and $A(G)$ is the adjacency matrix. The largest eigenvalue of $Q(G)$ is called the signless Laplacian spectral…

Let $G$ be a connected graph on $n$ vertices, and let $D(G)$ be the distance matrix of $G$. Let $\partial_1(G)\ge\partial_2(G)\ge\cdots\ge\partial_n(G)$ denote the eigenvalues of $D(G)$. In this paper, we characterize all connected graphs…

Inspired by the Li--Yau eigenvalue-diameter estimates, we investigate lower bounds for the first Dirichlet eigenvalue in terms of the diameter (or inscribed radius) of a graph. Let $G = (V, E)$ be a graph with boundary $B$. Assume that the…

We bound the second eigenvalue of random $d$-regular graphs, for a wide range of degrees $d$, using a novel approach based on Fourier analysis. Let $G_{n, d}$ be a uniform random $d$-regular graph on $n$ vertices, and let $\lambda (G_{n,…

Let $\partial^L_1\ge\partial^L_2\ge\cdots\ge\partial^L_n$ be the distance Laplacian eigenvalues of a connected graph $G$ and $m(\partial^L_i)$ the multiplicity of $\partial^L_i$. It is well known that the graphs with $m(\partial^L_1)=n-1$…