THE MONOID OF STRONG ENDOMORPHISMS OF A GRAPH

被引：1

作者：

LI, WM ^{[1
]}

机构：

[1] UNIV OLDENBURG,DEPT MATH,D-26111 OLDENBURG,GERMANY

来源：

SEMIGROUP FORUM | 1994年 / 49卷 / 02期

关键词：

D O I：

10.1007/BF02573480

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

We explicitly find all the idempotents in each L(R)-class and all the inverses of each element of the strong endomorphism monoid of a graph. The number of these idempotents and inverses is also obtained.

引用

页码：143 / 149

页数：7

共 7 条

[1] ON THE STRUCTURE OF SEMIGROUPS [J].

GREEN, JA .

ANNALS OF MATHEMATICS, 1951, 54 (01) :163-172

[2]

Harary F, 1969, GRAPH THEORY, DOI DOI 10.21236/AD0705364

[3]

Howie J. M., 1976, INTRO SEMIGROUP THEO

[4]

KANUER U, 1989, ARCH MATH, V52, P607

[5] ENDOMORPHISMS OF GRAPHS .2. VARIOUS UNRETRACTIVE GRAPHS [J].

KNAUER, U .

ARCHIV DER MATHEMATIK, 1990, 55 (02) :193-203

[6] GREEN RELATIONS ON THE STRONG ENDOMORPHISM MONOID OF A GRAPH [J].

LI, WM .

SEMIGROUP FORUM, 1993, 47 (02) :209-214

[7]

Miller D.D., 1956, T AM MATH SOC, V82, P270

← 1 →