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.

Saved in:
Bibliographic Details
Published in:Algebra and Discrete Mathematics
Date:2018
Main Authors: Knauer, U., Pipattanajinda, N.
Format: Article
Language:English
Published: Інститут прикладної математики і механіки НАН України 2018
Online Access:https://nasplib.isofts.kiev.ua/handle/123456789/188413
Tags: Add Tag
No Tags, Be the first to tag this record!
Journal Title:Digital Library of Periodicals of National Academy of Sciences of Ukraine
Cite this:A formula for the number of weak endomorphisms on paths / U. Knauer, N. Pipattanajinda // Algebra and Discrete Mathematics. — 2018. — Vol. 26, № 2. — С. 270–279. — Бібліогр.: 5 назв. — англ.

Institution

Digital Library of Periodicals of National Academy of Sciences of Ukraine
_version_ 1862648182108848128
author Knauer, U.
Pipattanajinda, N.
author_facet Knauer, U.
Pipattanajinda, N.
citation_txt A formula for the number of weak endomorphisms on paths / U. Knauer, N. Pipattanajinda // Algebra and Discrete Mathematics. — 2018. — Vol. 26, № 2. — С. 270–279. — Бібліогр.: 5 назв. — англ.
collection DSpace DC
container_title Algebra and Discrete Mathematics
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-01T14:25:39Z
format Article
fulltext
id nasplib_isofts_kiev_ua-123456789-188413
institution Digital Library of Periodicals of National Academy of Sciences of Ukraine
issn 1726-3255
language English
last_indexed 2025-12-01T14:25:39Z
publishDate 2018
publisher Інститут прикладної математики і механіки НАН України
record_format dspace
spelling Knauer, U.
Pipattanajinda, N.
2023-02-27T16:17:21Z
2023-02-27T16:17:21Z
2018
A formula for the number of weak endomorphisms on paths / U. Knauer, N. Pipattanajinda // Algebra and Discrete Mathematics. — 2018. — Vol. 26, № 2. — С. 270–279. — Бібліогр.: 5 назв. — англ.
1726-3255
2010 MSC: 05C30; 05C38.
https://nasplib.isofts.kiev.ua/handle/123456789/188413
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.
The authors would like to thank Prof. Dr. Srichan Arworn for the help and the encouragement that she provided in the preparation of this paper. The work was partially supported by the Research and Development Institute and the Faculty of Sciences and Technology, Kamphaeng Phet Rajabhat University, Kamphaeng Phet, Thailand.
en
Інститут прикладної математики і механіки НАН України
Algebra and Discrete Mathematics
A formula for the number of weak endomorphisms on paths
Article
published earlier
spellingShingle A formula for the number of weak endomorphisms on paths
Knauer, U.
Pipattanajinda, N.
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
url https://nasplib.isofts.kiev.ua/handle/123456789/188413
work_keys_str_mv AT knaueru aformulaforthenumberofweakendomorphismsonpaths
AT pipattanajindan aformulaforthenumberofweakendomorphismsonpaths
AT knaueru formulaforthenumberofweakendomorphismsonpaths
AT pipattanajindan formulaforthenumberofweakendomorphismsonpaths