SearcharxivSearch

arXiv · 1711.02701

Cayley properties of the line graphs induced by consecutive layers of the hypercube

Abstract

Let $n >3$ and $ 0< k < \frac{n}{2} $ be integers. In this paper, we investigate some algebraic properties of the line graph of the graph $ {Q_n}(k,k+1) $ where $ {Q_n}(k,k+1) $ is the subgraph of the hypercube $Q_n$ which is induced by the set of vertices of weights $k$ and $k+1$. In the first step, we determine the automorphism groups of these graphs for all values of $n,k$. In the second step, we study Cayley properties of the line graphs of these graphs. In particular, we show that if $k\geq 3$ and $ n \neq 2k+1$, then except for the cases $k=3, n=9$ and $k=3, n=33$, the line graph of the graph $ {Q_n}(k,k+1) $ is a vertex-transitive non-Cayley graph. Also, we show that the line graph of the graph $ {Q_n}(1,2) $ is a Cayley graph if and only if $ n$ is a power of a prime $p$. Moreover, we show that for \lq{}almost all\rq{} even values of $k$, the line graph of the graph $ {Q_{2k+1}}(k,k+1) $ is a vertex-transitive non-Cayley graph.

Explore related subjects

Keep this discovery

BibTeXRIS

S. Morteza Mirafzal. 2017-11-07. Cayley properties of the line graphs induced by consecutive layers of the hypercube. https://arxiv.org/abs/1711.02701

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