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 |
---|---|
格式: | 雜誌 |
出版: |
2018
|
主題: | |
在線閱讀: | https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=41549100031&origin=inward http://cmuir.cmu.ac.th/jspui/handle/6653943832/60552 |
標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
相似書籍
-
An algorithm for the numbers of endomorphisms on paths (DM13208)
由: Sr Arworn
出版: (2018) -
An algorithm for the numbers of endomorphisms on paths (DM13208)
由: Sr Arworn
出版: (2018) -
Naturally ordered strong endomorphisms on graphs
由: Nirutt Pipattanajinda, et al.
出版: (2020) -
On transitive Cayley graphs of strong semilattices of right (left) groups
由: S. Panma, et al.
出版: (2018) -
On transitive Cayley graphs of strong semilattices of right (left) groups
由: S. Panma, et al.
出版: (2018)