Contents

-

1-Factorizations of Cayley Graphs

A. Abdollahi1
1DEPARTMENT OF MATHEMATICS, UNIVERSITY OF ISFAHAN, ISFAHAN 81746-71441, IRAN; AND INSTITUTE FOR STUDIES IN THEORETICAL PHYSICS AND MATHEMATICS (IPM); TEHRAN, IRAN.

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.