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.

Збережено в:
Бібліографічні деталі
Опубліковано в: :Algebra and Discrete Mathematics
Дата:2014
Автори: Pipattanajinda, N., Knauer, U., Gyurov, B., Panma, S.
Формат: Стаття
Мова:Англійська
Опубліковано: Інститут прикладної математики і механіки НАН України 2014
Онлайн доступ:https://nasplib.isofts.kiev.ua/handle/123456789/153354
Теги: Додати тег
Немає тегів, Будьте першим, хто поставить тег для цього запису!
Назва журналу:Digital Library of Periodicals of National Academy of Sciences of Ukraine
Цитувати: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 назв. — англ.

Репозитарії

Digital Library of Periodicals of National Academy of Sciences of Ukraine
_version_ 1862730692606033920
author Pipattanajinda, N.
Knauer, U.
Gyurov, B.
Panma, S.
author_facet Pipattanajinda, N.
Knauer, U.
Gyurov, B.
Panma, S.
citation_txt 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 назв. — англ.
collection DSpace DC
container_title Algebra and Discrete Mathematics
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.
first_indexed 2025-12-07T19:21:47Z
format Article
fulltext
id nasplib_isofts_kiev_ua-123456789-153354
institution Digital Library of Periodicals of National Academy of Sciences of Ukraine
issn 1726-3255
language English
last_indexed 2025-12-07T19:21:47Z
publishDate 2014
publisher Інститут прикладної математики і механіки НАН України
record_format dspace
spelling Pipattanajinda, N.
Knauer, U.
Gyurov, B.
Panma, S.
2019-06-14T03:28:00Z
2019-06-14T03:28:00Z
2014
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.
https://nasplib.isofts.kiev.ua/handle/123456789/153354
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.
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.
en
Інститут прикладної математики і механіки НАН України
Algebra and Discrete Mathematics
The endomorphisms monoids of graphs of order n with a minimum degree n − 3
Article
published earlier
spellingShingle The endomorphisms monoids of graphs of order n with a minimum degree n − 3
Pipattanajinda, N.
Knauer, U.
Gyurov, B.
Panma, S.
title The endomorphisms monoids of graphs of order n with a minimum degree n − 3
title_full The endomorphisms monoids of graphs of order n with a minimum degree n − 3
title_fullStr The endomorphisms monoids of graphs of order n with a minimum degree n − 3
title_full_unstemmed The endomorphisms monoids of graphs of order n with a minimum degree n − 3
title_short The endomorphisms monoids of graphs of order n with a minimum degree n − 3
title_sort endomorphisms monoids of graphs of order n with a minimum degree n − 3
url https://nasplib.isofts.kiev.ua/handle/123456789/153354
work_keys_str_mv AT pipattanajindan theendomorphismsmonoidsofgraphsofordernwithaminimumdegreen3
AT knaueru theendomorphismsmonoidsofgraphsofordernwithaminimumdegreen3
AT gyurovb theendomorphismsmonoidsofgraphsofordernwithaminimumdegreen3
AT panmas theendomorphismsmonoidsofgraphsofordernwithaminimumdegreen3
AT pipattanajindan endomorphismsmonoidsofgraphsofordernwithaminimumdegreen3
AT knaueru endomorphismsmonoidsofgraphsofordernwithaminimumdegreen3
AT gyurovb endomorphismsmonoidsofgraphsofordernwithaminimumdegreen3
AT panmas endomorphismsmonoidsofgraphsofordernwithaminimumdegreen3