Paperlane

no. 16 · Tuesday 17 November 2026

On the multiplicity of the Laplacian eigenvalue 1 of a graph

Fei Wen, Kai Wang and Tao Wang

math.CO

Abstract

A connected graph $G$ with $n\ge 2$ vertices and $\varepsilon$ edges is called a \emph{$k$-cyclic graph} if $k=\varepsilon-n+1$. The Laplacian matrix is defined as $L(G)=D(G)-A(G)$, where $D(G)$ is the diagonal matrix of vertex degrees and $A(G)$ is the adjacency matrix of $G$. Let $m_{G}(1)$ be the multiplicity of the Laplacian eigenvalue $1$ of $G$. In this paper, we show that for fixed integers $n\ge \big\lceil\frac{3+\sqrt{8k+1}} {2}\big\rceil$ and $k\geq0$, if $G$ is a $k$-cyclic graph of order $n$, then \begin{equation*} \displaystyle m_{G}(1)\leq n-\big\lceil\frac{3+\sqrt{8k+1}} {2}\big\rceil \end{equation*} and moreover, we completely characterize all extremal graphs attained the upper bound.

fields
Combinatorics
pdf ↗ page arXiv:2611.19326 ↗