The automorphism group of the $s$-stable Kneser graphs
Combinatorics
2015-11-24 v2
Abstract
For , the -stable Kneser graphs are the graphs with vertex set the -subsets of such that the circular distance between any two elements in is at least and two vertices are adjacent if and only if the corresponding -subset are disjoint. Braun showed that for the automorphism group of the -stable Kneser graphs (Schrijver graphs) is isomorphic to the dihedral group of order . In this paper we generalize this result by proving that for and the automorphism group of the -stable Kneser graphs also is isomorphic to the dihedral group of order .
Keywords
Cite
@article{arxiv.1509.09185,
title = {The automorphism group of the $s$-stable Kneser graphs},
author = {Pablo Torres},
journal= {arXiv preprint arXiv:1509.09185},
year = {2015}
}