A formula for the number of weak endomorphisms on paths

Ulrich Knauer, Nirutt Pipattanajinda

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

Full Text:

PDF

Refbacks

  • There are currently no refbacks.