Naturally ordered strong endomorphisms on graphs
© 2019, Springer Japan KK, part of Springer Nature. In this paper, we study the natural partial order ≤ on SEnd(G), the strong endomorphism monoid of a finite graph G and characterize minimal elements and maximal elements of (SEnd(G) , ≤). Then we introduce the concept of connectedness on (SEnd(G) ,...
Saved in:
Main Authors: | Nirutt Pipattanajinda, Yangkok Kim, Srichan Arworn |
---|---|
Format: | Journal |
Published: |
2020
|
Subjects: | |
Online Access: | https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85074269110&origin=inward http://cmuir.cmu.ac.th/jspui/handle/6653943832/67899 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Chiang Mai University |
Similar Items
-
The endomorphism monoids of (n − 3)-regular graphs of order n
by: Nirutt Pipattanajinda, et al.
Published: (2018) -
Locally strong endomorphisms of paths
by: Sr Arworn, et al.
Published: (2018) -
The endomorphism monoids of (n − 3)-regular graphs of order n
by: Pipattanajinda N., et al.
Published: (2017) -
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)