| Inverses of Regular Strong Endomorphisms of Graphs |
| Received:April 04, 1996 Revised:March 01, 1998 |
| Key Words:
strong endomorphism （commuting） pseudo inverse monoid graph.
|
| Fund Project:Partially supported by the National Natural Science Foundation of China. |
|
| Hits: 2167 |
| Download times: 1206 |
| 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 |
