An approach to construct an end-regular graph (Q1129811): Difference between revisions

The paper contributes to the question: For which graphs \(G\) is the endomorphism monoid of \(G\) regular? Such graphs are called end-regular. The author proves as a main result that a graph \(G\) is end-regular if and only if \(G+K_n\) is end-regular where \(K_n\) is the complete graph on \(n\) vertices, \(n\geq 1\), and \(+\) denotes the join, that is, all vertices of \(G\) are connected to all vertices of \(K_n\). On the way the author proves that every graph \(B_i\), \(i\in I\), is end-regular if there exists a graph \(G\) such that the generalized lexicographic product \(G[B_i]_{i\in I}\), \(| I| = | V(G)| \), is end-regular. This implies one direction of the proof of the main result since \(G+K_n = K_2[G,K_n]\), i.e. \(G + K_n\) is a generalized lexicographic product.