Title of article
An algorithm for the numbers of endomorphisms on paths (DM13208)
Author/Authors
Sr. Arworn، نويسنده , , Sr.، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2009
Pages
10
From page
94
To page
103
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
Square lattice , PATH , Graph endomorphism
Journal title
Discrete Mathematics
Serial Year
2009
Journal title
Discrete Mathematics
Record number
1598467
Link To Document