Optimization of eigenvalue bounds for the independence and chromatic number of graph powers

Aida Abiad, Gabriel Coutinho, Miquel Angel Fiol +2

The $k^{\text{th}}$ power of a graph $G=(V,E)$, $G^k$, is the graph whose vertex set is $V$ and in which two distinct vertices are adjacent if and only if their distance in $G$ is…