The endomorphisms monoids of graphs of order \(n\) with a minimum degree \(n-3\)

• Дата: 2018
• Автори: Pipattanajinda, Nirutt, Knauer, Ulrich, Gyurov, Boyko, Panma, Sayan
• Формат: Стаття
• Мова: English
• Опубліковано: Lugansk National Taras Shevchenko University 2018
• Теми: Graph of order \(n\) which minimal degree \(n-3\); graph endomorphism; regular; orthodox; completely regular; 05C25; 05C38
• Онлайн доступ: https://admjournal.luguniv.edu.ua/index.php/adm/article/view/1061
• Назва журналу: Algebra and Discrete Mathematics

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.