Answers are grounded in this paper and cite their sources.
The set Si,n={0,1,2,…,n−1,n}\{i} {S}i,n=\{0,1,2,… ,n-1,n\} \{i\} , 1⩽i⩽n 1 i n , is called Laplacian realizable if there exists an undirected simple graph whose Laplacian spectrum is Si,n {S}i,n . The existence of such graphs was established by Fallat et al. (On graphs whose Laplacian matrices have distinct integer eigenvalues, J. Graph Theory50(2005), 162–174). In this article, we consider graphs whose Laplacian spectra have the form S{i,j}nm={0,1,2,…,m−1,m,m,m+1,…,n−1,n}\{i,j},0<i
No takes yet. Share an insight, caveat, or question.
Hameed et al. (2023) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: