Locally strong endomorphisms of paths
We determine the number of locally strong endomorphisms of directed and undirected paths-direction here is in the sense of a bipartite graph from one partition set to the other. This is done by the investigation of congruence classes, leading to the concept of a complete folding, which is used to ch...
Saved in:
Main Authors: | Sr Arworn, U. Knauer, S. Leeratanavalee |
---|---|
Format: | Journal |
Published: |
2018
|
Subjects: | |
Online Access: | https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=41549100031&origin=inward http://cmuir.cmu.ac.th/jspui/handle/6653943832/60552 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Chiang Mai University |
Similar Items
-
An algorithm for the numbers of endomorphisms on paths (DM13208)
by: Sr Arworn
Published: (2018) -
An algorithm for the numbers of endomorphisms on paths (DM13208)
by: Sr Arworn
Published: (2018) -
Naturally ordered strong endomorphisms on graphs
by: Nirutt Pipattanajinda, et al.
Published: (2020) -
On transitive Cayley graphs of strong semilattices of right (left) groups
by: S. Panma, et al.
Published: (2018) -
On transitive Cayley graphs of strong semilattices of right (left) groups
by: S. Panma, et al.
Published: (2018)