English

Integral Laplacian graphs with a unique double Laplacian eigenvalue, I

Combinatorics 2025-07-01 v1

Abstract

The set Si,n={0,1,2,,n1,n}{i}S_{i,n}=\{0,1,2,\ldots,n-1,n\}\setminus\{i\}, 1in1\leqslant i\leqslant n is called Laplacian realizable if there exists an undirected simple graph whose Laplacian spectrum is Si,nS_{i,n}. The existence of such graphs was established by S. Fallat et al. in 2005. In this paper, we investigate graphs whose Laplacian spectra have the form S{i,j}nm={0,1,2,,m1,m,m,m+1,,n1,n}{i,j},0<i<jn, S_{\{i,j\}_{n}^{m}}=\{0,1,2,\ldots,m-1,m,m,m+1,\ldots,n-1,n\}\setminus\{i,j\},\qquad 0<i<j\leqslant n, and completely describe those ones with m=n1m=n-1 and m=nm=n. We also show close relations between graphs realizing Si,nS_{i,n} and S{i,j}nmS_{\{i,j\}_{n}^{m}}, and discuss the so-called Sn,nS_{n,n}-conjecture and the correspondent conjecture for S{i,n}nmS_{\{i,n\}_{n}^{m}}.

Keywords

Cite

@article{arxiv.2206.00980,
  title  = {Integral Laplacian graphs with a unique double Laplacian eigenvalue, I},
  author = {Abdul Hameed and Mikhail Tyaglov},
  journal= {arXiv preprint arXiv:2206.00980},
  year   = {2025}
}

Comments

16 pages, 4 tables

R2 v1 2026-06-24T11:37:03.651Z