Decomposition of hypercubes into sunlet graphs of order eight
-
Published:2021-05-10
Issue:
Volume:
Page:2150123
-
ISSN:1793-8309
-
Container-title:Discrete Mathematics, Algorithms and Applications
-
language:en
-
Short-container-title:Discrete Math. Algorithm. Appl.
Author:
Sonawane A. V.1,
Borse Y. M.1
Affiliation:
1. Department of Mathematics, Savitribai Phule Pune University, Pune 411 007, India
Abstract
The sunlet graph of order eight, denoted by [Formula: see text] is the graph obtained by adding a pendant edge to each vertex of a cycle of length [Formula: see text] We prove that the [Formula: see text]-dimensional hypercube [Formula: see text] can be decomposed into the copies of the graph [Formula: see text] if and only if [Formula: see text] is 4 or [Formula: see text]
Publisher
World Scientific Pub Co Pte Lt
Subject
Discrete Mathematics and Combinatorics