Cayley properties of line graphs of consecutive layers of hypercube
S. Morteza Mirafzal
Abstract
S. Morteza Mirafzal
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$.
OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
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