In this paper,the author gives a characterization for a graph G such that sEnd(G), the monoid of the strong endomorphisms of G,is the union of groups.In particular,if this is the case,the author explicitly finds the identity element of each group in sEnd(G).
