| INVERSE MONOIDS OF GRAPHS |
| |
| 作者姓名： | 李为民 |
| |
| 作者单位： | Department of Mathematics，Shanghai Jiaotong University，Shanghai 200030，China |
| |
| 摘 要： | . IntroductionGraph endomorphism and its regularity property have been investigated in some literatures (of. 1--41 for examples). The invertibility is a stronger algebraic property thanregUlarity in semigroup theory. It is commonly agreed that inverse semigroups are the mostpromising class of semigroups for study. In this paper we first present a combinatorial characterization of an inverse monoid of a graph (Theorem 2.3). Then using this we prove thata bipartite graph with an inverse monoi…
|
| 收稿时间： | 20 April 1998 |
Inverse monoids of graphs |
| |
| Li Weimin.INVERSE MONOIDS OF GRAPHS[J].Acta Mathematicae Applicatae Sinica,2000,16(1):93-99. |
| |
| Authors: | Li Weimin |
| |
| Institution: | (1) Department of Mathematics, Shanghai Jiaotong University, 200030 Shanghai, China |
| |
| Abstract: | In this paper we first present a combinatorial characterization of an inverse monoid of a graph. Then using this we prove that a bipartite graph with an inverse monoid is uniquely K_2, and that a graph G has an inverse monoid if and only if the join of G and a complete graph also has an inverse monoid. |
| |
| Keywords: | Endomorphism inverse monoid graph |
| 本文献已被 CNKI SpringerLink 等数据库收录！ |
