On wreathed lexicographic products of graphs |
| |
| Authors: | Roland Kaschek |
| |
| Institution: | Information Science Research Center in Palmerston North, New Zealand |
| |
| Abstract: | This paper proves a necessary and sufficient condition for the endomorphism monoid  of a lexicographic product GH] of graphs G,H to be the wreath product  of the monoids  and  . The paper also gives respective necessary and sufficient conditions for specialized cases such as for unretractive or triangle-free graphs G. |
| |
| Keywords: | Finite graph Endomorphism Lexicographic product Wreath product |
| 本文献已被 ScienceDirect 等数据库收录！ |
