Retractions of split graphs and End-orthodox split graphs
A finite graph \(\Gamma\) is said to be split if its vertex set can be partitioned into two subsets \(K\) and \(I\), so that every pair of vertices of \(K\) is joined by an edge of \(\Gamma\), and no two vertices of \(I\) are. A monoid \(M\) is called regular if, given any \(a\in M\), there is an element \(b \in M\) so that \(aba=a\), and a regular monoid is called orthodox if the product of any two idempotents is idempotent. A graph is called End-orthodox if its endomorphism monoid is orthodox. In this paper, the author finds a necessary and sufficient condition for a split graph to be End-orthodox.
- Partial automorphisms and injective partial endomorphisms of a finite undirected path
- Trees whose regular endomorphisms form a monoid
- Ranks of monoids of endomorphisms of a finite undirected path
- The join of split graphs whose completely regular endomorphisms form a monoid
- Split graphs whose half-strong endomorphisms form a monoid
- Endomorphism monoids of generalized split graphs.
- THE JOIN OF SPLIT GRAPHS WHOSE QUASI-STRONG ENDOMORPHISMS FORM A MONOID
- The join of split graphs whose regular endomorphisms form a monoid
- The join of split graphs whose half-strong endomorphisms form a monoid
This page was built for publication: Retractions of split graphs and End-orthodox split graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1850000)
