On End-regular graphs (Q1126182): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q4855966 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4841642 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Parallel concepts in graph theory / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4126563 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Unretractive and S-unretractive joins and lexicographic products of graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Endomorphisms of graphs. II: Various unretractive graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the regularity of semidirect products / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Orthodox semidirect products and wreath products of monoids / rank | |||
Normal rank |
Latest revision as of 16:10, 24 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On End-regular graphs |
scientific article |
Statements
On End-regular graphs (English)
0 references
19 May 1997
0 references
A monoid which is von Neumann regular is called orthodox if its idempotents form a submonoid. A graph is called (End)-regular or (End)-orthodox if its monoid of graph endomorphisms is a (von Neumann) regular or orthodox monoid. Here graph endomorphisms are mappings of the vertex set which preserve edges. The author proves, for example, the following results. The monoid \(\text{End} X [\text{End} Y]\) is regular if the following conditions are satisfied: (1) \(\text{End} X\) and \(\text{End} Y\) are regular, and (2) \(\text{End} X\) or \(\text{End} Y\) is a group. The monoid \(\text{End} X [\text{End} Y]\) is orthodox if and only if the following conditions are satisfied: (1) \(\text{End} X\) and \(\text{End} Y\) are orthodox, and (2) \(\text{End} X\) is a group, or \(\text{End} Y\) is a group and \(\text{End} X\) is left inverse. Here \(\text{End} X [\text{End} Y]\) denotes the wreath product of the monoids \(\text{End} X\) and \(\text{End} Y\) through the left \(\text{End} X\)-act \(X\).
0 references
monoid
0 references
orthodox
0 references
graph endomorphisms
0 references
wreath product
0 references