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: | , , |
|---|---|
| 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 |
| Summary: | © 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) , ≤) by using the natural partial order ≤ and determine the number of connected components of SEnd(G) under certain conditions. |
|---|