✦ LIBER ✦

Automorphisms of the unions of direct products of finite graphs

✍ Scribed by E. G. Davydov

Publisher: Springer US
Year: 1972
Tongue: English
Weight: 622 KB
Volume: 4
Category: Article
ISSN: 1573-8337
DOI: 10.1007/bf01071490

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Automorphisms of direct products of fini

Automorphisms of direct products of finite groups

✍ J. N. S. Bidwell; M. J. Curran; D. J. McCaughan 📂 Article 📅 2006 🏛 Springer 🌐 English ⚖ 91 KB

Automorphisms of direct products of fini

Automorphisms of direct products of finite groups II

✍ J. N. S. Bidwell 📂 Article 📅 2008 🏛 Springer 🌐 English ⚖ 174 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

Direct products of finite groups as unio

Direct products of finite groups as unions of proper subgroups

✍ Martino Garonzi; Andrea Lucchini 📂 Article 📅 2010 🏛 Springer 🌐 English ⚖ 142 KB

On bounded automorphisms of locally fini

On bounded automorphisms of locally finite transitive graphs

✍ Niemeyer, Peter 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 517 KB

The automorphism-group of an infinite graph acts in a natural way on the set of d-fibers (components of the set of rays with respect to the Hausdorff metric). For connected, locally finite, almost transitive graphs the kernel of this action is proved to be the group of bounded automorphisms. This co

Complexity of homomorphisms to direct pr

Complexity of homomorphisms to direct products of graphs

✍ Judit Büki; Csaba Szabó 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 55 KB

For a graph G, OAL G asks whether or not an input graph H together with a partial map g : G 2 are trees and NP-complete otherwise.