QuSoft seminar: Aida Abiad (Eindhoven University)
QuSoft seminar with Aida Abiad (Eindhoven University): Eigenvalue bounds for the independence and chromatic number of graph powers. If you would like to attend, please contact Jop Briët (j.briet@cwi.nl) or Subhasree Patro (Subhasree.Patro@cwi.nl).
- https://www.cwi.nl/research/groups/algorithms-and-complexity/events/qusoft-seminar-aida-abiad-eindhoven-university
- QuSoft seminar: Aida Abiad (Eindhoven University)
- 2021-01-15T13:00:00+01:00
- 2021-01-15T14:00:00+01:00
- QuSoft seminar with Aida Abiad (Eindhoven University): Eigenvalue bounds for the independence and chromatic number of graph powers. If you would like to attend, please contact Jop Briët (j.briet@cwi.nl) or Subhasree Patro (Subhasree.Patro@cwi.nl).
- What English Algorithms & Complexity
- When 15-01-2021 from 13:00 to 14:00 (Europe/Amsterdam / UTC100)
- Contact Name Jop Briet
-
Add event to calendar
iCal
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).