Loading...
Loading...

Go to the content (press return)

On the k-independence number of graphs

Author
Abiad, A.; G. Coutinho; Fiol, M.
Type of activity
Journal article
Journal
Discrete mathematics
Date of publication
2019
DOI
10.1016/j.disc.2019.01.016
Repository
http://hdl.handle.net/2117/131577 Open in new window
URL
https://www.sciencedirect.com/science/article/abs/pii/S0012365X19300275?via%3Dihub Open in new window
Abstract
This paper generalizes and unifies the existing 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 the main results in this work.Weshow that for most cases our bounds outperform the previous known bounds. Some infinite families of graphs where the bounds are tight are also presented. Finally, as a byproduct, we derive some spectral lower b...
Citation
Abiad, A.; G. Coutinho; Fiol, M. On the k-independence number of graphs. "Discrete mathematics", 2019.
Keywords
Antipodal distance-regular graph, Interlacing, Regular partition, Spectrum, k-independence number
Group of research
COMBGRAPH - Combinatorics, Graph Theory and Applications

Participants