✦ LIBER ✦

The graphical complexity of direct products of permutation groups

✍ Scribed by Mariusz Grech

Publisher: John Wiley and Sons
Year: 2010
Tongue: English
Weight: 167 KB
Volume: 66
Category: Article
ISSN: 0364-9024
DOI: 10.1002/jgt.20504

No coin nor oath required. For personal study only.

✦ Synopsis

In this article, we improve known results, and, with one exceptional case, prove that when k ≥ 3, the direct product of the automorphism groups of graphs whose edges are colored using k colors, is itself the automorphism group of a graph whose edges are colored using k colors. We have handled the case k = 2 in an earlier article. We prove similar results for directed edge-colored graphs.

📜 SIMILAR VOLUMES

Mutually Permutable Products of Finite G

Mutually Permutable Products of Finite Groups

✍ A. Ballester-Bolinches; M.D. Pérez-Ramos; M.C. Pedraza-Aguilera 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 76 KB

Mutually Permutable Products of Finite G

Mutually Permutable Products of Finite Groups, II

✍ A. Ballester-Bolinches; M.C. Pedraza-Aguilera 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 81 KB

Direct products of automorphism groups o

Direct products of automorphism groups of graphs

✍ Mariusz Grech 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 121 KB

## Abstract In this article we study the product action of the direct product of automorphism groups of graphs. We generalize the results of Watkins [J. Combin Theory 11 (1971), 95–104], Nowitz and Watkins [Monatsh. Math. 76 (1972), 168–171] and W. Imrich [Israel J. Math. 11 (1972), 258–264], and w

Representing the Quotient Groups of a Fi

Representing the Quotient Groups of a Finite Permutation Group

✍ Derek F. Holt; Jacqueline Walton 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 207 KB

Let G be a permutation group of finite degree d. We prove that the product of the orders of the composition factors of G that are not alternating groups acting naturally, in a sense that will be made precise, is bounded by c d-1 /d, where c = 4 5. We use this to prove that any quotient G/N of G has

Computing the Subgroups of a Permutation

Computing the Subgroups of a Permutation Group

✍ John J. Cannon; Bruce C. Cox; Derek F. Holt 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 279 KB

A new method for computing the conjugacy classes of subgroups of a finite group is described.

On the Movement of a Permutation Group

✍ Peter M. Neumann; Cheryl E. Praeger 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 56 KB