English

Some algebraic properties of bipartite Kneser graphs

Group Theory 2018-04-13 v1

Abstract

Let nn and kk be integers with n>k1n> k\geq1 and [n]={1,2,...,n}[n] = \{1, 2, ... , n\} . The bipartite Kneser graphbipartite \ Kneser \ graph H(n,k)H(n, k) is the graph with the all kk-element and all (nkn-k)-element subsets of [n][n] as vertices, and there is an edge between any two vertices, when one is a subset of the other. In this paper, we show that H(n,k)H(n, k) is an arc-transitive graph. Also, we show that H(n,1)H(n,1) is a distance-transitive Cayley graph. Finally, we determine the automorphism group of the graph H(n,1)H(n, 1) and show that Aut(H(n,1))Sym([n])Aut(H(n, 1)) \cong Sym([n] ) ×Z2\times \mathbb{Z}_2, where Z2\mathbb{Z}_2 is the cyclic group of order 22. Moreover, we pose some open problems about the automorphism group of the bipartite Kneser graph H(n,k)H(n, k).

Keywords

Cite

@article{arxiv.1804.04570,
  title  = {Some algebraic properties of bipartite Kneser graphs},
  author = {S. Morteza Mirafzal and Ali Zafari},
  journal= {arXiv preprint arXiv:1804.04570},
  year   = {2018}
}

Comments

To appear in Ars Combinatoria. arXiv admin note: text overlap with arXiv:1803.02524