摘要
确定了一些基本图的〔强〕自同态摹群的基数，并在证明过程中实际上确定了这些摹群的全部元素，同时发现确定一些极其简单的图之自同态摹群却是极其困难的事情，有时甚至导致一些一般的组合难题．
In this parer, the cardinalities of the (strong) endomorphism monoids of some basic graphs are determined, and actually all elements of these monoids are determined in the prove. It is pointed out that sometimes it is so difficult to determine the monoids of some very simple graphs that it may result in some difficult problems in the general combinatorics.
出处
《烟台大学学报（自然科学与工程版）》
CAS
1998年第4期243-247,共5页
Journal of Yantai University(Natural Science and Engineering Edition)
关键词
图
自同态
摹群
简单图
相依矩阵
强自同态
graph, (strong) endomorphism, monoid, attached permutation, attached function, attached matrix
