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., 2014, Volume 18, Issue 2,Pages 274

This article is cited in 2 papers

RESEARCH ARTICLE

The endomorphisms monoids of graphs of order $n$ with a minimum degree $n-3$

Nirutt Pipattanajinda^a, Ulrich Knauer^b, Boyko Gyurov^c, Sayan Panma^d

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

MSC: 05C25, 05C38

Received: 16.03.2012
Revised: 19.08.2013

Language: English