On End-regular graphs

DOI10.1016/0012-365X(95)00101-2zbMath0862.05048MaRDI QIDQ1126182

Suohai Fan

Publication date: 19 May 1997

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

wreath productgraph endomorphismsmonoidorthodox

Mathematics Subject Classification ID

Paths and cycles (05C38) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Structural characterization of families of graphs (05C75)

Related Items (14)

Unicyclic graphs with regular endomorphism monoids ⋮ On the Endomorphism Monoid of K(n,3) ⋮ End-regular and End-orthodox generalized lexicographic products of bipartite graphs ⋮ End-regular and End-orthodox lexicographic products of bipartite graphs ⋮ The endomorphism monoid of \(\overline{P_n}\). ⋮ Graphs whose endomorphism monoids are regular ⋮ Representations of the strong endomorphism monoid of finite \(n\)-uniform hypergraphs ⋮ Unnamed Item ⋮ Naturally ordered strong endomorphisms on graphs ⋮ End-regularity of generalized bicycle graph ⋮ End-regularity of zero-divisor graphs of group rings ⋮ Green's relations in some categories of strong graph homomorphisms ⋮ Generalized symmetry of graphs - a survey ⋮ Generalized symmetry of graphs

Cites Work

• Orthodox semidirect products and wreath products of monoids
• Parallel concepts in graph theory
• Endomorphisms of graphs. II: Various unretractive graphs
• On the regularity of semidirect products
• Unretractive and S-unretractive joins and lexicographic products of graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On End-regular graphs