RUS  ENG
Полная версия
ЖУРНАЛЫ // Algebra and Discrete Mathematics // Архив

Algebra Discrete Math., 2018, том 26, выпуск 2, страницы 270–279 (Mi adm683)

RESEARCH ARTICLE

A formula for the number of weak endomorphisms on paths

Ulrich Knauera, Nirutt Pipattanajindab

a Institut für Mathematik, Carl von Ossietzky Universität, D-26111 Oldenburg, Germany
b Faculty of Sciences and Technology, Kamphaeng Phet Rajabhat University, Kamphaeng Phet, Thailand

Аннотация: 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.

Ключевые слова: path, weak endomorphisms, three-dimensional square lattices.

MSC: Primary 05C30; Secondary 05C38

Поступила в редакцию: 24.11.2016
Исправленный вариант: 09.12.2018

Язык публикации: английский



© МИАН, 2024