On unretractive graphs |
| |
| Authors: | Roland Kaschek |
| |
| Affiliation: | a Information Science Research Centre, New Zealand |
| |
| 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. |
| |
| Keywords: | Finite graph Endomorphism Unretractive Core Lexicographic product Wreath product |
| 本文献已被 ScienceDirect 等数据库收录！ |
