On the Cayleyness of bipartite Kneser graphs

Document Type : Full Length Article

Author

Lorestan university

Abstract

For any given $n,k \in \mathbb{N}$ with $ 2k < n, $ the $bipartite\ Kneser \ graph$ $H(n, k)$ is defined as the graph whose vertex set is the family of $k$-subsets and ($n-k$)-subsets of $[n] = \{1, 2,\dots, n\}, $ in which
any two vertices are adjacent if and only if one of them is a subset of the other.
In this paper, we study some algebraic properties of the bipartite Kneser graph $H(n, k)$. In particular, we determine the values of $n,k$, for which the bipartite Kneser
graph $H(n,k)$ is a Cayley graph.

Graphical Abstract

On the Cayleyness of bipartite Kneser graphs

Keywords

Main Subjects


Volume 9, Issue 3
September 2024
Pages 203-210
  • Receive Date: 09 August 2024
  • Revise Date: 17 August 2024
  • Accept Date: 30 August 2024
  • Publish Date: 01 September 2024