Decompositions of some classes of regular graphs into cycles and paths of length eight
Cecily Sahai. C, Sampath Kumar. S, Arputha Jose. T

TL;DR
This paper investigates the conditions under which certain regular graphs, specifically tensor and wreath products of complete graphs, can be decomposed into cycles and paths of length eight.
Contribution
It provides necessary and sufficient conditions for the existence of (8; p, q)-decompositions in these classes of regular graphs.
Findings
Established conditions for tensor product decompositions.
Established conditions for wreath product decompositions.
Contributed to the understanding of cycle and path decompositions in regular graphs.
Abstract
Let (resp. ) denote the cycle (resp. path) of length . In this paper, we examine the necessary and sufficient conditions for the existence of a -decomposition of tensor product and wreath product of complete graphs.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
Topicsgraph theory and CDMA systems · Interconnection Networks and Systems · Coding theory and cryptography
