论文信息 - On End-regular graphs

On End-regular graphs

Abstract A graph X is End-regular if its endomorphism monoid End X is regular in the semigroup sense, that is, for any f in End X there exists g in End X with fgf = f . End-regular bipartite graphs were characterized in [1]. In this paper, End-regular graphs are obtained through the lexicographic product of End-regular graphs, and strong End-regular graphs (End-orthodox graphs) are investigated.

Suohai Fan

[1] J. Howie. An introduction to semigroup theory , 1976 .

[2] Ulrich Knauer. Unretractive and S-unretractive joins and lexicographic products of graphs , 1987, J. Graph Theory.

[3] Tatsuhiko Saito. Orthodox semidirect products and wreath products of monoids , 1989 .

[4] William R. Nico. On the regularity of semidirect products , 1983 .

[5] Ulrich Knauer. Endomorphisms of graphs II. Various unretractive graphs , 1990 .

[6] Frank Harary,et al. Graph Theory , 2016 .