Alspach has conjectured that any 2k-regular connected Cayley graph cay(A, S) on a finite abelian group A can be decomposed into k hamiltonian cycles. In this paper, the conjecture is shown to be true if S=[s 1 , s 2 , ..., s k ] is a minimal generating set of an abelian group A of odd order (where a
“On Orders Solely of Abelian Groups, III”—A Correction
✍ Scribed by Yingchun Cai
- Publisher
- Elsevier Science
- Year
- 1997
- Tongue
- English
- Weight
- 171 KB
- Volume
- 65
- Category
- Article
- ISSN
- 0022-314X
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
Let F be a free group of rank n. Denote by Out F its outer automorphism n n group, that is, its automorphism group modulo its inner automorphism group. For arbitrary n, by considering group actions on finite connected graphs, we derived the maximum order of finite abelian subgroups in Out F . Moreov
## Abstract In § l of this article, we study group‐theoretical properties of some automorphism group Ψ^\*^ of the meta‐abelian quotient § of a free pro‐__l__ group § of rank two, and show that the conjugacy class of some element of order two of Ψ^\*^ is not determined by the action induced on the a
## Abstract The codewords at distance three from a particular codeword of a perfect binary one‐error‐correcting code (of length 2^m^−1) form a Steiner triple system. It is a longstanding open problem whether every Steiner triple system of order 2^m^−1 occurs in a perfect code. It turns out that thi
A convenient method of preparing ultrafine poly(methylstyrene) (PMS) latex particles with aldehyde groups on the surface is developed. PMS latexes in the size range 33-81 nm were prepared via microemulsion polymerization, using cetyltrimethylammonium bromide (CTAB) as surfactant. The surface of the