A complete characterization of bidegreed split graphs with four distinct signless Laplacian eigenvalues
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.
- Complete characterization of the bidegreed split graphs with three or four distinct \(A_{\alpha}\)-eigenvalues
- Characterization of split graphs with at most four distinct eigenvalues
- On split graphs with four distinct eigenvalues
- Bipartiteness and the least eigenvalue of signless Laplacian of graphs
- scientific article; zbMATH DE number 6129422
- On signed graphs with just two distinct Laplacian eigenvalues
- Graphs with the second signless Laplacian eigenvalue \(\leq 4\)
- Complete split graph determined by its (signless) Laplacian spectrum
- Graphs with fourth largest signless-Laplacian eigenvalue less than two.
- Spectral characterizations of graphs with at most two (signless) Laplacian eigenvalues greater than 2.
- Characterization of split graphs with at most four distinct eigenvalues
- Combinatorial Designs
- scientific article; zbMATH DE number 1600999 (Why is no real title available?)
- scientific article; zbMATH DE number 3910422 (Why is no real title available?)
- On split graphs with four distinct eigenvalues
- Schur complements and statistics
- Spectra of graphs
- Split non-threshold Laplacian integral graphs
- The toughness of split graphs
- Variations on a theorem of Ryser
- Vulnerability parameters of split graphs
- On split graphs with four distinct eigenvalues
- Characterization of split graphs with at most four distinct eigenvalues
- Complete characterization of the bidegreed split graphs with three or four distinct \(A_{\alpha}\)-eigenvalues
- On split graphs with three or four distinct (normalized) Laplacian eigenvalues
- Spectral properties of \(\mathcal{C}\)-graphs
This page was built for publication: A complete characterization of bidegreed split graphs with four distinct signless Laplacian eigenvalues
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1979376)
