|
Algebra and Discrete Mathematics, 2018, Volume 26, Issue 2, Pages 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
Abstract:
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.
Keywords:
path, weak endomorphisms, three-dimensional square lattices.
Received: 24.11.2016 Revised: 09.12.2018
Citation:
Ulrich Knauer, Nirutt Pipattanajinda, “A formula for the number of weak endomorphisms on paths”, Algebra Discrete Math., 26:2 (2018), 270–279
Linking options:
https://www.mathnet.ru/eng/adm683 https://www.mathnet.ru/eng/adm/v26/i2/p270
|
Statistics & downloads: |
Abstract page: | 195 | Full-text PDF : | 55 | References: | 29 |
|