2017arXiv (Cornell University)Open access

Cayley properties of line graphs of consecutive layers of hypercube

S. Morteza Mirafzal

Open full text 1 citations

Abstract

Let $n >3$ and $ 0 1, $ if $n \neq 2k+1$, then 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$.

About this research paper

What this paper is about

Let $n >3$ and $ 0 1, $ if $n \neq 2k+1$, then 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$.

Why it matters

OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Let $n >3$ and $ 0 1, $ if $n \neq 2k+1$, then 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$.

Key concepts: Vertex-transitive graph, Cayley graph, Combinatorics, Line graph, Mathematics, Symmetric graph, Graph, Petersen graph

Related papers

Back to paper searchBrowse research topicsOriginal source
Cayley properties of line graphs of consecutive layers of hypercube — Research Paper | ScholarLens