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:
Bibliographic Details
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 Mathematics