Retractions of split graphs and End-orthodox split graphs
type: Item
instance of: scholarly article
title: Retractions of split graphs and End-orthodox split graphs
zbMATH Open document ID: 1010.05036
DOI: 10.1016/S0012-365X(02)00388-6
author: Suohai Fan
published in: Discrete Mathematics
publication date: 2002-12-02T00:00:00Z
review text: 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.
reviewed by: Carl Droms
Mathematics Subject Classification ID: 05C25
zbMATH DE Number: 1838981
zbMATH Keywords: split graph
zbMATH Keywords: endomorphism monoid
zbMATH Keywords: End-orthodox
MaRDI profile type: Publication
full work available at URL: s0012-365x(02)00388-6
OpenAlex ID: W2009139532
description: scientific article; zbMATH DE number 1838981