SearcharxivSearch

arXiv · 1804.04570

Some algebraic properties of bipartite Kneser graphs

Abstract

Let $n$ and $k$ be integers with $n> k\geq1$ 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)) \cong Sym([n] )$ $\times \mathbb{Z}_2$, where $\mathbb{Z}_2$ 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)$.

Explore related subjects

Keep this discovery

BibTeXRIS

S. Morteza Mirafzal, Ali Zafari. 2018-04-12. Some algebraic properties of bipartite Kneser graphs. https://arxiv.org/abs/1804.04570

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Reversibility and its asymptotic counting in Picard group

We investigate reversible elements in the Picard modular group $\mathrm{PSL}(2,\mathbb{Z}[i])$. We show that reversibility coincides with strong reversibility for Kleinian groups, in particular for the Picard group. We classify reversible elements in the Picard group and characterize loxodromic reversible elements up to conjugacy. We prove that each such conjugacy class contains exactly eight special representatives. We also obtain asymptotic estimates for the number of reversible conjugacy classes with bounded trace.

math.GR

Conjugator length in finitely generated groups

We describe all functions $\mathbb{N}\rightarrow \mathbb{N}$ that can be realized, up to the standard equivalence, as conjugator length functions of finitely generated groups. Furthermore, we show that any two increasing functions $f,g\colon \mathbb N\to \mathbb N$ can be simultaneously realized as conjugator length functions of finitely generated, commensurable (in particular, quasi-isometric) groups.

math.GR

The spectrum of conjugator length functions

A recent program tries to find which functions appear as conjugator length functions. In this note, we show that any (computable) increasing function larger than $n$ appears as $\mathrm{Cl}_G$ for some finitely generated (recursively presented) group. On the other hand, we demonstrate that either $\mathrm{Cl}_G$ must be constant or $\mathrm{Cl}_G(n)\succ n$. Combining these, we obtain a complete description of which functions appear as conjugator length functions of finitely generated groups.

math.GR