The endomorphisms monoids of graphs of order n with a minimum degree n − 3
Vernadsky National Library of Ukraine
Переглянути архів ІнформаціяПоле | Співвідношення | |
Title |
The endomorphisms monoids of graphs of order n with a minimum degree n − 3
|
|
Creator |
Pipattanajinda, N.
Knauer, U. Gyurov, B. Panma, S. |
|
Description |
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.
|
|
Date |
2019-06-14T03:28:00Z
2019-06-14T03:28:00Z 2014 |
|
Type |
Article
|
|
Identifier |
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 назв. — англ.
1726-3255 2010 MSC:05C25, 05C38. http://dspace.nbuv.gov.ua/handle/123456789/153354 |
|
Language |
en
|
|
Relation |
Algebra and Discrete Mathematics
|
|
Publisher |
Інститут прикладної математики і механіки НАН України
|
|