The endomorphisms monoids of graphs of order n with a minimum degree n − 3
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.
Saved in:
| Date: | 2014 |
|---|---|
| Main Authors: | , , , |
| Format: | Article |
| Language: | English |
| Published: |
Інститут прикладної математики і механіки НАН України
2014
|
| Series: | Algebra and Discrete Mathematics |
| Online Access: | http://dspace.nbuv.gov.ua/handle/123456789/153354 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Journal Title: | Digital Library of Periodicals of National Academy of Sciences of Ukraine |
| Cite this: | 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 назв. — англ. |