Наукова електронна бібліотека
періодичних видань НАН України
періодичних видань НАН України
The endomorphisms monoids of graphs of order n with a minimum degree n − 3
Репозиторій DSpace/Manakin
JavaScript is disabled for your browser. Some features of this site may not work without it.
The endomorphisms monoids of graphs of order n with a minimum degree n − 3
Інший ID:
2010 MSC:05C25, 05C38.
Посилання:
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 назв. — англ.
Підтримка:
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.
Дата:
2014
Переглядів:
510
Завантажень:
146
Анотація:
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.
