Idempotent endomorphisms of a graph

被引：0
|
作者：
Li, WM [1 ]
机构：
[1] Shanghai Jiao Tong Univ, Dept Math, Shanghai 200240, Peoples R China
来源：
DISCRETE MATHEMATICS | 2000年 / 223卷 / 1-3期
关键词：
idempotent endomorphisms; monoid; graph;
D O I：
10.1016/S0012-365X(00)00105-9
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
In this paper, we characterize graphs whose system of all non-identical idempotent endomorphisms includes sEnd\Aut and vice versa respectively, by which we further answer the following open question: under which condition the system of all non-identical idempotent endomorphisms coincides with sEnd\Aut? (C) 2000 Elsevier Science B.V. All rights reserved.
引用
收藏
页码：379 / 386
页数：8
相关论文
共 50 条
12345