Decomposition of hypercubes into sunlet graphs of order eight.
- Resource Type
- Article
- Authors
- Sonawane, A. V.; Borse, Y. M.
- Source
- Discrete Mathematics, Algorithms & Applications. May2022, Vol. 14 Issue 3, p1-7. 7p.
- Subject
- *HYPERCUBES
- Language
- ISSN
- 1793-8309
The sunlet graph of order eight, denoted by L 8 , is the graph obtained by adding a pendant edge to each vertex of a cycle of length 4. We prove that the n -dimensional hypercube Q n can be decomposed into the copies of the graph L 8 if and only if n is 4 or n ≥ 6. [ABSTRACT FROM AUTHOR]