End-regular and End-orthodox joins of split graphs.
Hailong Hou, Yanfeng Luo, Xinman Fan · Lanzhou University Institutional Repository · 2012
A graph X is said to be End-regular (resp., End-orthodox, End-inverse) if its endomorphism monoid End(X) is a regular (resp., orthodox, inverse) semigroup. In this paper, End-regular (resp., End-orthodox, End-inverse) graphs which are the join of split graphs X and Y are characterized. It is also p,roved that X + Y is never End-inverse for any split graphs X and Y.