Title of article :
On unretractive graphs
Author/Authors :
Kaschek، نويسنده , , Roland، نويسنده ,
Issue Information :
روزنامه با شماره پیاپی سال 2009
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 , Unretractive , endomorphism , CORE , lexicographic product , wreath product
Journal title :
Discrete Mathematics
Journal title :
Discrete Mathematics
