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