Isomorphism factorizations of the complete graph into Cayley graphs on CI-groups
Huye Chen, Jingjian Li, Hao Yu, Zitong Yu

TL;DR
This paper characterizes when complete graphs can be decomposed into isomorphic Cayley graphs on CI-groups, providing necessary and sufficient conditions and a construction method for such factorizations.
Contribution
It establishes a complete characterization of CI-groups allowing edge-partitions of complete graphs into isomorphic Cayley graphs, and introduces a construction method for these factorizations.
Findings
Necessary and sufficient condition for CI-groups to admit such factorizations.
A construction method for isomorphic factorizations into Cayley graphs.
Extension of classical graph decomposition results to Cayley graphs on CI-groups.
Abstract
Isomorphic factorizations of complete graphs originate from the seminal work of Frank Harary and collaborators, who initiated the systematic study of decompositions of complete graphs into pairwise isomorphic spanning subgraphs. In this paper, we investigate isomorphic factorizations of complete graphs into Cayley graphs on CI-groups. Let denote the Cayley graph of finite group . We obtain a necessary and sufficient condition on CI-group so that the complete graph on vertices can be edge-partitioned into -copies of Cayley graph of the same CI-group each isomorphic to for some inverse-closed subset . Further we give a construction of isomorphic factorizations of the complete graph into Cayley graphs on CI-group.
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 · Finite Group Theory Research · Rings, Modules, and Algebras
