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...

Full description

Saved in:
Bibliographic Details
Main Authors: Nirutt Pipattanajinda, Ulrich Knauer, Boyko Gyurov, Sayan Panma, V. Mazorchuk
Format: Journal
Published: 2018
Subjects:
Online Access:https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85016938384&origin=inward
http://cmuir.cmu.ac.th/jspui/handle/6653943832/55987
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Chiang Mai University
id th-cmuir.6653943832-55987
record_format dspace
spelling th-cmuir.6653943832-559872018-09-05T03:07:11Z The endomorphism monoids of (n − 3)-regular graphs of order n Nirutt Pipattanajinda Ulrich Knauer Boyko Gyurov Sayan Panma V. Mazorchuk Mathematics © 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, orthodox and completely regular endomorphisms of the join of complements of cycles, i.e. (n − 3)-regular graphs of order n. 2018-09-05T03:07:11Z 2018-09-05T03:07:11Z 2016-01-01 Journal 17263255 2-s2.0-85016938384 https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85016938384&origin=inward http://cmuir.cmu.ac.th/jspui/handle/6653943832/55987
institution Chiang Mai University
building Chiang Mai University Library
country Thailand
collection CMU Intellectual Repository
topic Mathematics
spellingShingle Mathematics
Nirutt Pipattanajinda
Ulrich Knauer
Boyko Gyurov
Sayan Panma
V. Mazorchuk
The endomorphism monoids of (n − 3)-regular graphs of order n
description © 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, orthodox and completely regular endomorphisms of the join of complements of cycles, i.e. (n − 3)-regular graphs of order n.
format Journal
author Nirutt Pipattanajinda
Ulrich Knauer
Boyko Gyurov
Sayan Panma
V. Mazorchuk
author_facet Nirutt Pipattanajinda
Ulrich Knauer
Boyko Gyurov
Sayan Panma
V. Mazorchuk
author_sort Nirutt Pipattanajinda
title The endomorphism monoids of (n − 3)-regular graphs of order n
title_short The endomorphism monoids of (n − 3)-regular graphs of order n
title_full The endomorphism monoids of (n − 3)-regular graphs of order n
title_fullStr The endomorphism monoids of (n − 3)-regular graphs of order n
title_full_unstemmed The endomorphism monoids of (n − 3)-regular graphs of order n
title_sort endomorphism monoids of (n − 3)-regular graphs of order n
publishDate 2018
url https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85016938384&origin=inward
http://cmuir.cmu.ac.th/jspui/handle/6653943832/55987
_version_ 1681424607824838656