Naturally ordered strong endomorphisms on graphs
From MaRDI portal
Publication:2287753
DOI10.1007/s00373-019-02109-zzbMath1469.20056OpenAlexW2982138120WikidataQ126990079 ScholiaQ126990079MaRDI QIDQ2287753
Srichan Arworn, Nirutt Pipattanajinda, Yangkok Kim
Publication date: 21 January 2020
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-019-02109-z
Partial orders, general (06A06) General structure theory for semigroups (20M10) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Endomorphism spectra of graphs
- Green's relations on the strong endomorphism monoid of a graph
- Graphs whose endomorphism monoids are regular
- Naturally ordered transformation semigroups
- On End-regular graphs
- Postscript: ``Endomorphism spectra of graphs [Discrete Mathematics 109 (1992) 45--57]
- Endomorphisms of graphs. I: The monoid of strong endomorphisms
- Endomorphisms of graphs. II: Various unretractive graphs
- Graphs with regular monoids
- Graphs with a regular endomorphism monoid
- The endotype of an \((n-3)\)-regular graph of order \(n\)
- A Natural Partial Order for Semigroups
- Unretractive and S-unretractive joins and lexicographic products of graphs
- The natural partial order on a regular semigroup
- A regular endomorphism of a graph and its inverses
This page was built for publication: Naturally ordered strong endomorphisms on graphs
