| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4649197 | Discrete Mathematics | 2009 | 11 Pages |
Abstract
The present paper proves necessary and sufficient conditions for both lexicographic products and arbitrary graphs to be unretractive. The paper also proves that the automorphism group of a lexicographic product of graphs is isomorphic to a wreath product of a monoid with a small category.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Roland Kaschek,