Abstract
Let n and k be integers with \(n>2k\), \(k\ge 1\). We denote by H(n, k) the bipartite Kneser graph, that is, a graph with the family of k-subsets and (\(n-k\))-subsets of \([n] = \{1, 2,\ldots , n\}\) as vertices, in which any two vertices are adjacent if and only if one of them is a subset of the other. In this paper, we determine the automorphism group of H(n, k). We show that \(\mathrm{Aut}(H(n, k))\cong \mathrm{Sym}([n]) \times {\mathbb {Z}}_2\), where \({\mathbb {Z}}_2\) is the cyclic group of order 2. Then, as an application of the obtained result, we give a new proof for determining the automorphism group of the Kneser graph K(n, k). In fact, we show how to determine the automorphism group of the Kneser graph K(n, k) given the automorphism group of the Johnson graph J(n, k). Note that the known proofs for determining the automorphism groups of Johnson graph J(n, k) and Kneser graph K(n, k) are independent of each other.
Similar content being viewed by others
References
Biggs N L, Algebraic Graph Theory (second edition), Cambridge Mathematical Library (1993) (Cambridge: Cambridge University Press)
Brouwer A E, Cohen A M and Neumaier A, Distance-Regular Graphs (1989) (New York: Springer-Verlag)
Dalfo C, Fiol M A and Mitjana M, On middle cube graphs, Electronic J. Graph Theory Appl. 3(2) (2015) 133–145
Dixon J D and Mortimer B, Permutation Groups, Graduate Texts in Mathematics 163 (1996) (New York: Springer-Verlag)
Godsil C and Royle G, Algebraic Graph Theory (2001) (New York: Springer)
Havel I, Semipaths in directed cubes, in Graphs and Other Combinatorial Topics (ed.) M Fiedler (1983) (Teubner, Leipzig: Teunebner Texte Math)
Huang X and Huang Q, Automorphism group of the complete alternating group, Appl. Math. Computation 314 (2017) 58–64
Hujdurovic A, Kutnar K and Marusic D, Odd automorphisms in vertex-transitive graphs, Ars Math. Contemp. 10 (2016) 427–437
Jones G A, Automorphisms and regular embeddings of merged Johnson graphs, European J. Combinatorics 26 (2005) 417–435
Jones G A and Jajcay R, Cayley properties of merged Johnson graphs, J. Algebr. Comb. 44 (2016) 1047–1067
Kim J S, Cheng E, Liptak L and Lee H O, Embedding hypercubes, rings, and odd graphs into hyper-stars, Int. J. Computer Math. 86(5) (2009) 771–778
Mirafzal S M, On the symmetries of some classes of recursive circulant graphs, Trans. Combin. 3(1) (2014) 1–6
Mirafzal S M, On the automorphism groups of regular hyperstars and folded hyperstars, Ars Comb. 123 (2015) 75–86
Mirafzal S M, Some other algebraic properties of folded hypercubes, Ars Comb. 124 (2016) 153–159
Mirafzal S M, A note on the automorphism groups of Johnson graphs, arXiv:1702.02568v4, submitted
Mirafzal S M and Zafari A, Some algebraic properties of bipartite Kneser graphs, arXiv:1804.04570 [math.GR] 12 April 2018, to appear in Ars Combinatoria
Mütze T M and Su P, Bipartite Kneser graphs are Hamiltonian, Combinatorica 37(6) (2017) 1206–1219
Wang Y I, Feng Y Q and Zhou J X, Automorphism Group of the Varietal Hypercube Graph, Graphs and Combinatorics (2017); https://doi.org/10.1007/s00373-017-1827-y
Zhou J X, The automorphism group of the alternating group graph, Appl. Math. Lett. 24 (2011) 229–231
Acknowledgements
The author is thankful to the anonymous referees for their valuable comments and suggestions.
Author information
Authors and Affiliations
Corresponding author
Additional information
Communicating Editor: Sukanta Pati
Rights and permissions
About this article
Cite this article
Mirafzal, S.M. The automorphism group of the bipartite Kneser graph. Proc Math Sci 129, 34 (2019). https://doi.org/10.1007/s12044-019-0477-9
Received:
Revised:
Accepted:
Published:
DOI: https://doi.org/10.1007/s12044-019-0477-9