QuSoft seminar with Aida Abiad (Eindhoven University): Eigenvalue bounds for the independence and chromatic number of graph powers.
Abstract: In this talk we will see new spectral bounds for the k-independence number and the k-distance chromatic number of a graph.
Some of the previous bounds known in the literature follow as a corollary of our main results. Some infinite families of graphs where
the new bounds are tight are also presented.
If you would like to attend, please contact Jop Briët (j.briet@cwi.nl) or Subhasree Patro (Subhasree.Patro@cwi.nl).
