INVERSE MONOIDS OF GRAPHS

被引：0
|
作者：
李为民
机构：
来源：
Acta Mathematicae Applicatae Sinica(English Series) | 2000年 / 01期
关键词：
Endomorphism; inverse monoid; graph;
D O I：
暂无
中图分类号：
O157.5 [图论];
学科分类号：
摘要：
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 K2, 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.
引用
收藏
页码：93 / 99
页数：7
相关论文
共 50 条
12345