| E-H-Unretractivity of Bipartite Graphs |
| Received:March 05, 2007 Revised:July 13, 2007 |
| Key Words:
endomorphism monoid E-H-unretractivity bipartite graph.
|
| Fund Project:the National Natural Science Foundation of China (No.10671122). |
|
| Hits: 13801 |
| Download times: 1673 |
| Abstract: |
| By $\End(G)$ and $h\End(G)$ we denote the set of endomorphisms and half-strong endomorphisms of a graph $G$ respectively. A graph $G$ is said to be E-H-unretractive if $\End(G)=h\End(G)$. A general characterization of an E-H-unretractive graph seems to be difficult. In this paper, bipartite graphs with E-H-unretractivity are characterized explicitly. |
| Citation: |
| DOI:10.3770/j.issn:1000-341X.2009.02.008 |
| View Full Text View/Add Comment |
