The Endomorphism Monoids of (n − 3)-regular Graphs of Order n

dc.contributor.author	Gyurov, B.
dc.contributor.author	Knauer, U.
dc.contributor.author	Panma, S.
dc.contributor.author	Pipattanajinda, N.
dc.date.accessioned	2019-06-17T11:29:33Z
dc.date.available	2019-06-17T11:29:33Z
dc.date.issued	2016
dc.description.abstract	This paper is motivated by the result of W. Li, he presents an infinite family of graphs - complements of cycles - which possess a regular monoid. We show that these regular monoids are completely regular. Furthermore, we characterize the regular, orthodox and completely regular endomorphisms of the join of complements of cycles, i.e. (n−3)-regular graph of order n.	uk_UA
dc.identifier.citation	The Endomorphism Monoids of (n − 3)-regular Graphs of Order n / B. Gyurov, U. Knauer, S. Panma, N. Pipattanajinda // Algebra and Discrete Mathematics. — 2016. — Vol. 22, № 2. — С. 284-300. — Бібліогр.: 12 назв. — англ.	uk_UA
dc.identifier.issn	1726-3255
dc.identifier.other	2010 MSC:05C25, 05C38.
dc.identifier.uri	https://nasplib.isofts.kiev.ua/handle/123456789/155730
dc.language.iso	en	uk_UA
dc.publisher	Інститут прикладної математики і механіки НАН України	uk_UA
dc.relation.ispartof	Algebra and Discrete Mathematics
dc.status	published earlier	uk_UA
dc.title	The Endomorphism Monoids of (n − 3)-regular Graphs of Order n	uk_UA
dc.type	Article	uk_UA

Файли

Зараз показуємо 1 - 1 з 1

Зараз показуємо 1 - 1 з 1