A formula for the number of weak endomorphisms on paths

A weak endomorphisms of a graph is a mapping on the vertex set of the graph which preserves or contracts edges. In this paper we provide a formula to determine the cardinalities of weak endomorphism monoids of finite undirected paths.

Збережено в:
Бібліографічні деталі
Дата:2019
Автори: Knauer, Ulrich, Pipattanajinda, Nirutt
Формат: Стаття
Мова:Англійська
Опубліковано: Lugansk National Taras Shevchenko University 2019
Теми:
Онлайн доступ:https://admjournal.luguniv.edu.ua/index.php/adm/article/view/349
Теги: Додати тег
Немає тегів, Будьте першим, хто поставить тег для цього запису!
Назва журналу:Algebra and Discrete Mathematics

Репозитарії

Algebra and Discrete Mathematics
_version_ 1856543034106183680
author Knauer, Ulrich
Pipattanajinda, Nirutt
author_facet Knauer, Ulrich
Pipattanajinda, Nirutt
author_sort Knauer, Ulrich
baseUrl_str
collection OJS
datestamp_date 2019-01-24T08:21:31Z
description A weak endomorphisms of a graph is a mapping on the vertex set of the graph which preserves or contracts edges. In this paper we provide a formula to determine the cardinalities of weak endomorphism monoids of finite undirected paths.
first_indexed 2025-12-02T15:40:09Z
format Article
id admjournalluguniveduua-article-349
institution Algebra and Discrete Mathematics
language English
last_indexed 2025-12-02T15:40:09Z
publishDate 2019
publisher Lugansk National Taras Shevchenko University
record_format ojs
spelling admjournalluguniveduua-article-3492019-01-24T08:21:31Z A formula for the number of weak endomorphisms on paths Knauer, Ulrich Pipattanajinda, Nirutt path, weak endomorphisms, three-dimensional square lattices 05C30; 05C38 A weak endomorphisms of a graph is a mapping on the vertex set of the graph which preserves or contracts edges. In this paper we provide a formula to determine the cardinalities of weak endomorphism monoids of finite undirected paths. Lugansk National Taras Shevchenko University the Research and Development Institute and the Faculty of Sciences and Technology, Kamphaeng Phet Rajabhat University, Kamphaeng Phet, Thailand. 2019-01-24 Article Article Peer-reviewed Article application/pdf https://admjournal.luguniv.edu.ua/index.php/adm/article/view/349 Algebra and Discrete Mathematics; Vol 26, No 2 (2018) 2415-721X 1726-3255 en https://admjournal.luguniv.edu.ua/index.php/adm/article/view/349/pdf Copyright (c) 2019 Algebra and Discrete Mathematics
spellingShingle path
weak endomorphisms
three-dimensional square lattices
05C30
05C38
Knauer, Ulrich
Pipattanajinda, Nirutt
A formula for the number of weak endomorphisms on paths
title A formula for the number of weak endomorphisms on paths
title_full A formula for the number of weak endomorphisms on paths
title_fullStr A formula for the number of weak endomorphisms on paths
title_full_unstemmed A formula for the number of weak endomorphisms on paths
title_short A formula for the number of weak endomorphisms on paths
title_sort formula for the number of weak endomorphisms on paths
topic path
weak endomorphisms
three-dimensional square lattices
05C30
05C38
topic_facet path
weak endomorphisms
three-dimensional square lattices
05C30
05C38
url https://admjournal.luguniv.edu.ua/index.php/adm/article/view/349
work_keys_str_mv AT knauerulrich aformulaforthenumberofweakendomorphismsonpaths
AT pipattanajindanirutt aformulaforthenumberofweakendomorphismsonpaths
AT knauerulrich formulaforthenumberofweakendomorphismsonpaths
AT pipattanajindanirutt formulaforthenumberofweakendomorphismsonpaths