Inverses of Regular Strong Endomorphisms of Graphs  

图的正则强自态的逆(英文)

作　　者：李为民[1] 

机构地区：[1]上海交通大学数学系

出　　处：《Journal of Mathematical Research and Exposition》1998年第4期529-534,共6页数学研究与评论（英文版）

摘　　要：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.本文从组合角度明确刻画了图的完全正则强自同态的交换伪逆，同时给出它们的计数公式．

关 键 词：strong endomorphism (commuting) pseudo  inverse MONOID graph. 

分 类 号：O157.5[理学—数学]