Some algebraic properties of bipartite Kneser graphs

Abstract

Let n and k be integers with n> k≥1 and [n] = \1, 2, ... , n\ . The bipartite \ Kneser \ graph H(n, k) is the graph with the all k-element and all (n-k)-element subsets of [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) is an arc-transitive graph. Also, we show that H(n,1) is a distance-transitive Cayley graph. Finally, we determine the automorphism group of the graph H(n, 1) and show that Aut(H(n, 1)) Sym([n] ) × Z2, where Z2 is the cyclic group of order 2. Moreover, we pose some open problems about the automorphism group of the bipartite Kneser graph H(n, k).

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…