The endomorphisms monoids of graphs of order \(n\) with a minimum degree \(n-3\)
We characterize the endomorphism monoids, \(End(G)\), of the generalized graphs \(G\) of order \(n\) with a minimum degree \(n-3\). Criteria for regularity, orthodoxy and complete regularity of those monoids based on the structure of \(G\) are given.
Saved in:
| Date: | 2018 |
|---|---|
| Main Authors: | Pipattanajinda, Nirutt, Knauer, Ulrich, Gyurov, Boyko, Panma, Sayan |
| Format: | Article |
| Language: | English |
| Published: |
Lugansk National Taras Shevchenko University
2018
|
| Subjects: | |
| Online Access: | https://admjournal.luguniv.edu.ua/index.php/adm/article/view/1061 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Journal Title: | Algebra and Discrete Mathematics |
Institution
Algebra and Discrete MathematicsSimilar Items
-
The endomorphisms monoids of graphs of order \(n\) with a minimum degree \(n-3\)
by: Pipattanajinda, Nirutt, et al.
Published: (2018) -
The Endomorphism Monoids of (n − 3)-regular Graphs of Order n
by: Gyurov, Boyko, et al.
Published: (2016) -
The Endomorphism Monoids of (n − 3)-regular Graphs of Order n
by: Gyurov, Boyko, et al.
Published: (2016) -
A formula for the number of weak endomorphisms on paths
by: Knauer, Ulrich, et al.
Published: (2019) -
A formula for the number of weak endomorphisms on paths
by: Knauer, Ulrich, et al.
Published: (2019)