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

Abstract

Let n >3 and 0< k < n2 be integers. In this paper, we investigate some algebraic properties of the line graph of the graph Qn(k,k+1) where Qn(k,k+1) is the subgraph of the hypercube Qn 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≥ 3 and n ≠ 2k+1, then except for the cases k=3, n=9 and k=3, n=33, the line graph of the graph Qn(k,k+1) is a vertex-transitive non-Cayley graph. Also, we show that the line graph of the graph Qn(1,2) is a Cayley graph if and only if n is a power of a prime p. Moreover, we show that for almost all even values of k, the line graph of the graph Q2k+1(k,k+1) is a vertex-transitive non-Cayley graph.

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…