|
Algebra and Discrete Mathematics, 2014, том 18, выпуск 2, страницы 274–294
(Mi adm496)
|
|
|
|
Эта публикация цитируется в 2 научных статьях (всего в 2 статьях)
RESEARCH ARTICLE
The endomorphisms monoids of graphs of order $n$ with a minimum degree $n-3$
Nirutt Pipattanajindaa, Ulrich Knauerb, Boyko Gyurovc, Sayan Panmad a Faculty of Sciences and Technology, Kamphaeng Phet Rajabhat University
b Institut für Mathematik, Carl von Ossietzky University of Oldenburg
c School of Science and Technology, Georgia Gwinnett College, University System of Georgia
d Department of Mathematics, Faculty of Sciences, Chiang Mai Rajabhat University
Аннотация:
We characterize the endomorphism monoids, $\operatorname{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.
Ключевые слова:
graph of order $n$ which minimal degree $n-3$, graph endomorphism, regular, orthodox, completely regular.
Поступила в редакцию: 16.03.2012 Исправленный вариант: 19.08.2013
Образец цитирования:
Nirutt Pipattanajinda, Ulrich Knauer, Boyko Gyurov, Sayan Panma, “The endomorphisms monoids of graphs of order $n$ with a minimum degree $n-3$”, Algebra Discrete Math., 18:2 (2014), 274–294
Образцы ссылок на эту страницу:
https://www.mathnet.ru/rus/adm496 https://www.mathnet.ru/rus/adm/v18/i2/p274
|
Статистика просмотров: |
Страница аннотации: | 304 | PDF полного текста: | 108 | Список литературы: | 55 |
|