Abstract
By a -decomposition of a graph G, we mean a partition of the edge set of G into p paths of length 4 and q cycles of length 4. In this paper, we give conditions for a -decomposition of the n-dimensional hypercube graph Qn for all possible values of p and q. In particular, we find the necessary and sufficient conditions for such decomposition in Qn when n is even, and n is odd,
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: AKCE International Journal of Graphs and Combinatorics
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
