Background
Type:

1-factorizations of cayley graphs

Journal: Ars Combinatoria (03817032)Year: January 2008Volume: 86Issue: Pages: 129 - 131
Abdollahi A.a
a :University of Isfahan - IRAN(IR) - Isfahan
Language: English

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.

Author Keywords

1-factorizationsCayley graphsNilpotent groups