Speaker
LUIZ EMILIO ALLEM
(Universidade Federal do Rio Grande do Sul)
Description
We study the minimum number of distinct eigenvalues $q(G)$ of threshold graphs. It is known that every threshold graph satisfies $q(G)\leq 4$, which suggests that a complete combinatorial characterization according to the values $q(G)=2,3,4$ is possible.
In this talk, we present ongoing results toward such a characterization.
Author
LUIZ EMILIO ALLEM
(Universidade Federal do Rio Grande do Sul)
Co-authors
Lucas Siviero Sibemberg
(UFRGS)
Dr
Luciano Grippo
(Instituto de Ciencias - UNGS - CONICET)