Naturally ordered strong endomorphisms on graphs

• المؤلفون الرئيسيون: Nirutt Pipattanajinda, Yangkok Kim, Srichan Arworn
• التنسيق: دورية
• منشور في: 2020
• الموضوعات: Mathematics
• الوصول للمادة أونلاين: https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85074269110&origin=inward; http://cmuir.cmu.ac.th/jspui/handle/6653943832/67899

© 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) ,...