1-Factorizations of Cayley graphs

2007/05/02 by Aliréza Abdollahi, Alireza Abdollahi, Abdollahi, Alireza
Computer Science · Engineering · Mathematics · #05C25 #05C70 #Advanced Graph Theory Research #Combinatorics (math.CO) #FOS: Mathematics #Finite Group Theory Research #Group Theory (math.GR) #graph theory and CDMA systems #math.CO #math.GR #msc:05C25 #msc:05C70

paper · pdf · doi:10.48550/arxiv.0705.0193

arxiv created 2007/05/02 · openalex publication_date 2007/05/02 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

In this note we prove that all connected Cayley graphs of every finite group Q × H are 1-factorizable, where Q is any non-trivial group of 2-power order and H is any group of odd order.

Related

• On the power graphs which are Cayley graphs of some groups
• Vertex-regular 1-factorizations in infinite graphs
• Factorization graphs of finite groups
• Factorizations of almost simple groups with a solvable factor, and Cayley graphs of solvable groups
• Two families of graphs that are Cayley on nonisomorphic groups