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.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
