Запис Детальніше

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

Vernadsky National Library of Ukraine

Переглянути архів Інформація
 
 
Поле Співвідношення
 
Title The Endomorphism Monoids of (n − 3)-regular Graphs of Order n
 
Creator Gyurov, B.
Knauer, U.
Panma, S.
Pipattanajinda, N.
 
Description 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.
 
Date 2019-06-17T11:29:33Z
2019-06-17T11:29:33Z
2016
 
Type Article
 
Identifier 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 назв. — англ.
1726-3255
2010 MSC:05C25, 05C38.
http://dspace.nbuv.gov.ua/handle/123456789/155730
 
Language en
 
Relation Algebra and Discrete Mathematics
 
Publisher Інститут прикладної математики і механіки НАН України