Decomposition of hypercubes into sunlet graphs

Abstract: For any positive integer

k g e q 3,

the sunlet graph of order

2 k

, denoted by

L_{2 k},

is the graph obtained by adding a pendant edge to each vertex of a cycle of length

k .

In this paper, we prove that the necessary and sufficient condition for the existence of an

L_{16}

-decomposition of the

n

-dimensional hypercube

Q_{n}

is

n = 4

or

n g e q 6.

Also, we prove that for any integer

m g e q 2,

Q_{m n}

has an

L_{2 k}

-decomposition if

Q_{n}

has a

C_{k}

-decomposition.

This page was built for publication: Decomposition of hypercubes into sunlet graphs