What is it about?
we determine all graphs with all but two eigenvalues in the interval -2 to 0. All graphs are some specific complete multipartite graphs. Additionally, we find that almost all of them are determined by their spectrum.
Featured Image
Why is it important?
We generalized a result due to S.M. Cioab\u{a}, W.H. Haemers, J.R. Vermette and W. Wong. The graphs with all but two eigenvalues equal to $\pm 1$. Journal of Algebraic Combinatorics, 41:887-897, 2015.
Perspectives
We generalized a result due to S.M. Cioab\u{a}, W.H. Haemers, J.R. Vermette and W. Wong. The graphs with all but two eigenvalues equal to $\pm 1$. Journal of Algebraic Combinatorics, 41:887-897, 2015.
Prof Leonardo Silva de Lima
Universidade Federal do Parana
Read the Original
This page is a summary of: Graphs with all but two eigenvalues in [-2,0], Discussiones Mathematicae Graph Theory, January 2020, Faculty of Mathematics, Computer Science and Econometrics, University of Zielona Gora,
DOI: 10.7151/dmgt.2286.
You can read the full text:
Contributors
The following have contributed to this page
