|
Algebra and Discrete Mathematics, 2014, Volume 18, Issue 2, Pages 274–294
(Mi adm496)
|
|
|
|
This article is cited in 2 scientific papers (total in 2 papers)
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
Abstract:
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.
Keywords:
graph of order $n$ which minimal degree $n-3$, graph endomorphism, regular, orthodox, completely regular.
Received: 16.03.2012 Revised: 19.08.2013
Citation:
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
Linking options:
https://www.mathnet.ru/eng/adm496 https://www.mathnet.ru/eng/adm/v18/i2/p274
|
Statistics & downloads: |
Abstract page: | 303 | Full-text PDF : | 108 | References: | 55 |
|