Inverses of Regular Strong Endomorphisms of Graphs
Received:April 04, 1996  Revised:March 01, 1998
Key Word: strong endomorphism   (commuting) pseudo inverse   monoid   graph.  
Fund ProjectL:Partially supported by the National Natural Science Foundation of China.
Author NameAffiliation
Li Weimin Dept. of Math.
Shanghai Jiaotong University
200240 
Hits: 1951
Download times: 1028
Abstract:
      In this paper we explicitly describe all the commuting pseudo inverses of a completely regular strong endomorphism of a graph from a viewpoint of combinatorics. The number of them is also given. In addition, a strong endomorphism of a graph, whose commuting pseudo inverse set coincides with its pseudo inverse set, is identified.
Citation:
DOI:10.3770/j.issn:1000-341X.1998.04.009
View Full Text  View/Add Comment  Download reader