An approach to construct an end-regular graph

DOI10.1007/S11766-998-0038-YMaRDI QIDQ1129811zbMATH OpenOpenAlexFDO

Authors Weimin Li

Publication date 2 December 1998

Published in Applied Mathematics. Series B (English Edition) (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11766-998-0038-y

zbMATH Keywords

end-regular graphendomorphism monoidregular monoid

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75)

Review text

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.

Recommendations

• Graphs whose endomorphism monoids are regular
• End-regular generalized lexicographic products of bipartite graphs.
• End-completely-regular and End-inverse joins of graphs.
• End-completely-regular generalized lexicographic products of bipartite graphs.

Cites work

• A regular endomorphism of a graph and its inverses
• Endomorphism spectra of graphs
• Endomorphisms of graphs. I: The monoid of strong endomorphisms
• Graphs with a regular endomorphism monoid
• Green's relations on the strong endomorphism monoid of a graph
• scientific article; zbMATH DE number 3552814 (Why is no real title available?)
• Problems raised at the Problem Session of the Colloquium on Semigroups in Szeged, August 1987
• Semigroups of mappings on graphs

Cited in

(14)

• Inverse monoids of graphs
• Graphs with regular monoids
• The endotype of an (n-3)-regular graph of order n
• Non-commuting graphs of AC-groups are End-regular.
• Endo-regularity of cycle book graphs
• Endomorphism monoid of \(K(5m,5)\)
• Unicyclic graphs with regular endomorphism monoids
• End-completely-regular generalized lexicographic products of bipartite graphs.
• End-completely-regular and End-inverse joins of graphs.
• Endo-regularity of generalized wheel graphs
• Endomorphism monoid of \(C_{2n+1}\) book graphs
• End-regularity of generalized bicycle graph
• The endomorphisms monoids of Helm graph and its generalization
• Graphs whose endomorphism monoids are regular

This page was built for publication: An approach to construct an end-regular graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1129811)