| 二部图的E-H-不可收缩性 |
| |
| 引用本文： | 李为民.二部图的E-H-不可收缩性[J].数学研究及应用,2009,29(2):257-265. |
| |
| 作者姓名： | 李为民 |
| |
| 作者单位： | 上海交通大学数学系, 上海 200030 |
| |
| 基金项目： | 国家自然科学基金(No.10671122). |
| |
| 摘 要： | By End（G） and hEnd（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） = hEnd（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.
|
| 关 键 词： | 二部图 E-H不可收缩性 自同态幺半群 数学分析 |
| 收稿时间： | 3/5/2007 12:00:00 AM |
| 修稿时间： | 2007/7/13 0:00:00 |
E-H-Unretractivity of Bipartite Graphs |
| |
| LI Wei Min.E-H-Unretractivity of Bipartite Graphs[J].Journal of Mathematical Research with Applications,2009,29(2):257-265. |
| |
| Authors: | LI Wei Min |
| |
| Institution: | Department of Mathematics, Shanghai Jiaotong University, Shanghai 200030, China |
| |
| 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. |
| |
| Keywords: | endomorphism monoid E-H-unretractivity bipartite graph |
| 本文献已被 维普 万方数据 等数据库收录！ |
| 点击此处可从《数学研究及应用》浏览原始摘要信息 |
| 点击此处可从《数学研究及应用》下载免费的PDF全文 |
