✦ LIBER ✦

Thek-Orbit Reconstruction for Abelian and Hamiltonian Groups

✍ Scribed by V. B. Mnukhin

Book ID: 110230344
Publisher: Springer Netherlands
Year: 1998
Tongue: English
Weight: 145 KB
Volume: 52
Category: Article
ISSN: 0167-8019
DOI: 10.1023/a:1005907024475

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Abelian and hamiltonian groups with isom

Abelian and hamiltonian groups with isomorphic Burnside rings are isomorphic

✍ Alberto Raggi-Cárdenas; Ernesto Vallejo 📂 Article 📅 1992 🏛 Springer 🌐 English ⚖ 248 KB

Hamiltonian cycles and decompositions of

Hamiltonian cycles and decompositions of cayley digraphs of finite abelian groups

✍ Meng Jixiang; Huang Qiongxiang 📂 Article 📅 1997 🏛 SP Editorial Committee of Applied Mathematics - A 🌐 English ⚖ 319 KB

Application of theK-Orbit Method to a So

Application of theK-Orbit Method to a Solution of Thermodynamics Problems for Noncompact Lie Groups

✍ V. V. Mikheev; I. V. Shirokov 📂 Article 📅 2003 🏛 Springer 🌐 English ⚖ 217 KB

Orbit Equivalence and Topological Conjug

Orbit Equivalence and Topological Conjugacy of Affine Actionson Compact Abelian Groups

✍ Siddhartha Bhattacharya 📂 Article 📅 2000 🏛 Springer Vienna 🌐 English ⚖ 82 KB

Pseudo-cartesian product and hamiltonian

Pseudo-cartesian product and hamiltonian decompositions of Cayley graphs on abelian groups

✍ Cong Fan; Don R. Lick; Jiuqiang Liu 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 971 KB

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 we generalize a result by Kotzig that the Cartesian product of any two cycles can be decomposed into two hamiltonian cycles and show that

Hamiltonian cycles and paths in vertex-t

Hamiltonian cycles and paths in vertex-transitive graphs with abelian and nilpotent groups

✍ Marc J. Lipman 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 378 KB

In 1968, L. Lovfisz conjectured that every connected, vertex-transitive graph had a Hamiltonian path. In this paper the following results are proved: (1) If a connected graph has a transitive nilpotent group acting on it, then the graph has a Hamiltonian path; (2) a connected, vertex-transitive grap