1. Integral cographs.
- Author
-
Allem, Luiz Emilio and Tura, Fernando
- Subjects
- *
EIGENVALUES , *INTEGERS , *MATRICES (Mathematics) - Abstract
A graph is called integral if all the eigenvalues of its adjacency matrix are integers. In this paper, we show that a cograph that has a balanced cotree T G (a 1 , ... , a r − 1 , 0 | 0 , ... , 0 , a r) is integral. We present closed formulas for its eigenvalues. As application, we use the integral cographs to estimate the eigenvalues of any cograph. [ABSTRACT FROM AUTHOR]
- Published
- 2020
- Full Text
- View/download PDF