Optimization of eigenvalue bounds for the independence and chromatic number of graph powers
Sign Up to like & getrecommendations! Published in 2022 at "Discrete Mathematics"
DOI: 10.1016/j.disc.2021.112706
Abstract: 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 at most… read more here.
Keywords: eigenvalue bounds; graph; number; chromatic number ... See more keywords