An approach to construct an end-regular graph
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3552814 (Why is no real title available?)
- 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
- Problems raised at the Problem Session of the Colloquium on Semigroups in Szeged, August 1987
- Semigroups of mappings on graphs
Cited in
(14)- End-regularity of generalized bicycle graph
- Endo-regularity of generalized wheel graphs
- Endomorphism monoid of \(C_{2n+1}\) book graphs
- The endomorphisms monoids of Helm graph and its generalization
- Endomorphism monoid of \(K(5m,5)\)
- Graphs whose endomorphism monoids are regular
- Non-commuting graphs of AC-groups are End-regular.
- Unicyclic graphs with regular endomorphism monoids
- The endotype of an (n-3)-regular graph of order n
- Endo-regularity of cycle book graphs
- Graphs with regular monoids
- End-completely-regular and End-inverse joins of graphs.
- Inverse monoids of graphs
- End-completely-regular generalized lexicographic products of bipartite graphs.
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)
