An algorithm for the numbers of endomorphisms on paths (DM13208)

DOI10.1016/J.DISC.2007.12.049zbMath1215.05178OpenAlexW2079075845MaRDI QIDQ998497

Srichan Arworn

Publication date: 28 January 2009

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2007.12.049

zbMATH Keywords

pathsquare latticegraph endomorphism

Mathematics Subject Classification ID

Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (9)

Semigroup theory of symmetry ⋮ Unnamed Item ⋮ On the number of congruence classes of paths ⋮ Locally strong endomorphisms of paths ⋮ A note on counting homomorphisms of paths ⋮ Unnamed Item ⋮ Partial automorphisms and injective partial endomorphisms of a finite undirected path ⋮ Ranks of monoids of endomorphisms of a finite undirected path ⋮ An algorithm for the number of path homomorphisms

Cites Work

• Unnamed Item
• Postscript: ``Endomorphism spectra of graphs [Discrete Mathematics 109 (1992) 45--57]
• Counting lattice paths by Narayana polynomials
• An algorithm for finding the number of shortest routes on square lattices

This page was built for publication: An algorithm for the numbers of endomorphisms on paths (DM13208)