The endomorphism monoids of (n − 3)-regular graphs of order n
© Journal “Algebra and Discrete Mathematics”. This paper is motivated by the result of W. Li, that presents an infinite family of graphs - complements of cycles— which possess a regular monoid. We show that these regular monoids are completely regular. Furthermore, we characterize the regular, ortho...
Saved in:
Main Authors: | Pipattanajinda N., Knauer U., Gyurov B., Panma S., Mazorchuk V. |
---|---|
Format: | Journal |
Published: |
2017
|
Online Access: | https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85016938384&origin=inward http://cmuir.cmu.ac.th/jspui/handle/6653943832/42583 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Chiang Mai University |
Similar Items
-
The endomorphism monoids of (n − 3)-regular graphs of order n
by: Nirutt Pipattanajinda, et al.
Published: (2018) -
Naturally ordered strong endomorphisms on graphs
by: Nirutt Pipattanajinda, et al.
Published: (2020) -
Monoid of linear hypersubstitutions for algebraic systems of type ((n), (2)) and its regularity
by: Thodsaporn Kumduang, et al.
Published: (2020) -
Locally strong endomorphisms of paths
by: Sr Arworn, et al.
Published: (2018) -
Factorisable monoid of generalized hypersubstitutions of type<inf>T</inf> = (n)
by: Boonmee A., et al.
Published: (2017)