Title of article
Stable sets of maximal size in Kneser-type graphs
Author/Authors
Larose، نويسنده , , Benoit and Malvenuto، نويسنده , , Claudia، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2004
Pages
17
From page
657
To page
673
Abstract
We introduce a family of vertex-transitive graphs with specified subgroups of automorphisms which generalise Kneser graphs, powers of complete graphs and Cayley graphs of permutations. We compute the stability ratio for a wide class of these. Under certain conditions we characterise their stable sets of maximal size.
Keywords
Stable sets , Kneser graphs , Permutation graphs
Journal title
European Journal of Combinatorics
Serial Year
2004
Journal title
European Journal of Combinatorics
Record number
1548785
Link To Document