A complete characterization of bidegreed split graphs with four distinct signless Laplacian eigenvalues (Q1979376): Difference between revisions

Let \(G\) be a connected graph with diameter \(l\). Then \(G\) has at least \(l + 1\) distinct adjacency (resp, Laplacian, normalized Laplacian) eigenvalues; see [\textit{A. E. Brouwer} and \textit{W. H. Haemers}, Spectra of graphs. Berlin: Springer (2012; Zbl 1231.05001)] and [\textit{F. R. K. Chung}, Spectral graph theory. Providence, RI: AMS, American Mathematical Society (1997; Zbl 0867.05046)]. A graph is split if its vertex set can be partitioned into a clique and a stable set. Such graphs have diameter at most three. If all vertex degrees in a split graph are either \(\tilde{d}\) or \(\hat{d}\), then we say it is \((\tilde{d},\hat{d})\)-bidegreed. Recently, \textit{F. Goldberg} et al. [Discrete Appl. Math. 277, 163--171 (2020; Zbl 1435.05128)] characterized all the connected bidegreed split graphs of diameter 3 with exactly four distinct adjacency eigenvalues. Very recently, \textit{S. Li} and \textit{W. Sun} [``On split graphs with three or four distinct (normalized) Laplacian eigenvalues'', J. Comb. Des. 28, No. 11, 763--782 (2020; \url{doi:10.1002/jcd.21743})] completely identified the connected bidegreed graphs of diameter 2 (resp. 3) having exactly 3 (resp. 4) distinct Laplacian (resp, normalized Laplacian) eigenvalues. Furthermore, the connected bidegreed split graphs of diameter 2 having just four Laplacian (resp, normalized Laplacian) eigenvalues are characterized. Along the above line, in the current paper under review, the authors present a complete classification of the connected bidegreed split graphs of diameter 3 having exactly 4 distinct signless Laplacian eigenvalues. The results are interesting.