In this paper we characterize all bipartite graphs with at most six non-zero eigenvalues. We determine the eigenvalues of bipartite graphs that have at most four non-zero eigenvalues.
@article{749, title = {Bipartite graphs with at most six non-zero eigenvalues}, journal = {ARS MATHEMATICA CONTEMPORANEA}, volume = {12}, year = {2016}, doi = {10.26493/1855-3974.749.264}, language = {EN}, url = {http://dml.mathdoc.fr/item/749} }
Oboudi, Mohammad Reza. Bipartite graphs with at most six non-zero eigenvalues. ARS MATHEMATICA CONTEMPORANEA, Tome 12 (2016) . doi : 10.26493/1855-3974.749.264. http://gdmltest.u-ga.fr/item/749/