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

dc.contributor.author	Pipattanajinda, N.
dc.contributor.author	Knauer, U.
dc.contributor.author	Gyurov, B.
dc.contributor.author	Panma, S.
dc.date.accessioned	2019-06-14T03:28:00Z
dc.date.available	2019-06-14T03:28:00Z
dc.date.issued	2014
dc.identifier.citation	The endomorphisms monoids of graphs of order n with a minimum degree n − 3 / N. Pipattanajinda, U. Knauer, B. Gyurov, S. Panma // Algebra and Discrete Mathematics. — 2014. — Vol. 18, № 2. — С. 274–294. — Бібліогр.: 22 назв. — англ.	uk_UA
dc.identifier.issn	1726-3255
dc.identifier.other	2010 MSC:05C25, 05C38.
dc.identifier.uri	http://dspace.nbuv.gov.ua/handle/123456789/153354
dc.description.abstract	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.	uk_UA
dc.description.sponsorship	This work was partially supported by the Faculty of Science and Technology, Kamphaeng Phet Rajabhat University, Kamphaeng Phet, Thailand and the School of Science and Technology, Georgia Gwinnett College, Lawrenceville, GA.	uk_UA
dc.language.iso	en	uk_UA
dc.publisher	Інститут прикладної математики і механіки НАН України	uk_UA
dc.relation.ispartof	Algebra and Discrete Mathematics
dc.title	The endomorphisms monoids of graphs of order n with a minimum degree n − 3	uk_UA
dc.type	Article	uk_UA
dc.status	published earlier	uk_UA