Article ID Journal Published Year Pages File Type
4650201 Discrete Mathematics 2009 10 Pages PDF
Abstract

An endomorphism of a graph is a mapping on the vertex set of the graph which preserves edges. In this paper we provide an algorithm to determine the cardinalities of endomorphism monoids of finite undirected paths.

Keywords
Related Topics
Physical Sciences and Engineering Mathematics Discrete Mathematics and Combinatorics
Preview
An algorithm for the numbers of endomorphisms on paths (DM13208)
Authors
,