Graphs whose Laplacian eigenvalues are almost all 1 or 2
Sign Up to like & getrecommendations! Published in 2024 at "Special Matrices"
DOI: 10.1515/spma-2024-0015
Abstract: Abstract We explicitly determine all connected graphs whose Laplacian matrices have at most four eigenvalues different from 1 and 2. read more here.
Keywords: graphs whose; whose laplacian; eigenvalues almost; laplacian eigenvalues ... See more keywords