Title: On the k-independence number of graphs

Speaker：Aida Abiad, Maastricht University 马斯特里赫特大学 (助理教授)

Time：2019年11月21日             下午  16:00-17:00

Room：东区管理科研楼  数学科学学院1418室

Abstract：

In this talk I shall present recent spectral bounds on the k-independence number of a graph, which is  the  maximum  size  of  a  set  of  vertices  at  pairwise  distance  greater  than  k.  The  previous  bounds known in the literature follow as a corollary of our main results. We show that for most cases our bounds outperform the previous known bounds. Some infinite families of graphs where the bounds are tight are also presented. This is joint work with G. Coutinho and M.A. Fiol.