Full characterization of graphs having certain normalized Laplacian eigenvalue of multiplicity \(n-3\) (Q820993)

A characterisation of connected (simple) graphs of order \(n\), whose normalised Laplacian spectrum contains an eigenvalue of multiplicity \(n - 3\), is completed in the article. The only connected graph of order \(n\) with normalised Laplacian eigenvalue of multiplicity \(n-1\) is the complete graph \(K_n\), and the connected graphs with an eigenvalue of multiplicity \(n-2\) have been characterised by \textit{E. R. van Dam} and \textit{G. R. Omidi} [ibid. 435, No. 10, 2560--2569 (2011; Zbl 1222.05185)]. Regarding the characterisation of connected graphs with an eigenvalue of multiplicity \(n-3\), many partial results have been obtained by the first author et al. [ibid. 606, 127--143 (2020; Zbl 1447.05128)] and by \textit{S. Sun} and \textit{K. C. Das} [ibid. 609, 365--385 (2021; Zbl 1458.05156)]. Moreover, the latter authors have conjectured that there is no connected graph of order \(n \geq 6\) with independence number 2, whose largest normalised Laplacian eigenvalue is of multiplicity \(n - 3\); they have observed that the proof of this conjecture would complete the characterisation of the above described family of graphs. By utilising the results of the first author et al. [loc. cit.], the authors observe that the same conclusion can be reached by disproving existence of graphs taking a slightly more restricted form. They subsequently prove this nonexistence result, which thus completes the characterisation of connected graphs of order \(n\) with normalised Laplacian eigenvalue of multiplicity \(n - 3\), as well as confirms the conjecture of Sun and Das, [loc. cit.].