A problem concerning graphs with just three distinct eigenvalues
Sign Up to like & getrecommendations! Published in 2020 at "Linear Algebra and its Applications"
DOI: 10.1016/j.laa.2020.01.024
Abstract: Abstract We investigate the problem of finding all the biregular graphs with just three adjacency eigenvalues, one of which is an eigenvalue ≠ − 1 , 0 of maximal possible multiplicity. read more here.
Keywords: graphs three; concerning graphs; distinct eigenvalues; problem concerning ... See more keywords
A Complete Characterization of Bidegreed Split Graphs with Four Distinct α-Eigenvalues
Sign Up to like & getrecommendations! Published in 2022 at "Symmetry"
DOI: 10.3390/sym14050899
Abstract: It is a well-known fact that a graph of diameter d has at least d+1 eigenvalues. A graph is d-extremal (resp. dα-extremal) if it has diameter d and exactly d+1 distinct eigenvalues (resp. α-eigenvalues), and… read more here.
Keywords: bidegreed split; distinct eigenvalues; split graphs; characterization bidegreed ... See more keywords