Title of article
Graphs whose endomorphism monoids are regular Original Research Article
Author/Authors
Hailong Hou، نويسنده , , Yanfeng Luo، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2008
Pages
9
From page
3888
To page
3896
Abstract
In this paper, we give several approaches to construct new End-regular (-orthodox) graphs by means of the join and the lexicographic product of two graphs with certain conditions. In particular, the join of two connected bipartite graphs with a regular (orthodox) endomorphism monoid is explicitly described.
Keywords
Endomorphism monoids , Join of graphs , Lexicographic product of graphs , Regular , Orthodox
Journal title
Discrete Mathematics
Serial Year
2008
Journal title
Discrete Mathematics
Record number
946998
Link To Document