| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4648428 | Discrete Mathematics | 2010 | 7 Pages |
Abstract
This paper proves a necessary and sufficient condition for the endomorphism monoid EndG[H] of a lexicographic product G[H]G[H] of graphs G,HG,H to be the wreath product EndG≀EndH of the monoids EndG and EndH. The paper also gives respective necessary and sufficient conditions for specialized cases such as for unretractive or triangle-free graphs GG.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Roland Kaschek,