Generalized symmetry of graphs - a survey

DOI10.1016/j.disc.2009.02.027zbMath1185.05003OpenAlexW2041814971MaRDI QIDQ1044907

Suohai Fan

Publication date: 15 December 2009

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

Full work available at URL: https://doi.org/10.1016/j.disc.2009.02.027

zbMATH Keywords

graphendomorphismmonoidgeneralized symmetryend-regularend-transitiveunretractive

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25)

Related Items (2)

Beyond symmetry in generalized Petersen graphs ⋮ Green's classifications and evolutions of fixed-order networks

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Problems raised at the Problem Session of the Colloquium on Semigroups in Szeged, August 1987
• Endomorphism spectra of graphs
• The core of a graph
• Green's relations on the strong endomorphism monoid of a graph
• Graph multiplication
• Symmetric graphs and interpretations
• On Lovász' lattice reduction and the nearest lattice point problem
• On End-regular graphs
• Graph derivatives
• A survey of semigroups of continuous selfmaps
• Postscript: ``Endomorphism spectra of graphs [Discrete Mathematics 109 (1992) 45--57]
• Endomorphism spectra of bipartite graphs with diameter three and girth six
• Endomorphisms of graphs. I: The monoid of strong endomorphisms
• Endomorphisms of graphs. II: Various unretractive graphs
• Weakly symmetric graphs and their endomorphism monoids
• Graphs with a regular endomorphism monoid
• Graphs whose strong endomorphism monoids are regular
• Relations (graphs) with given finitely generated semigroups
• On weakly half-transitive graphs
• Unretractive and S-unretractive joins and lexicographic products of graphs
• A regular endomorphism of a graph and its inverses
• Bipartite graphs and their endomorphism monoids
• On unretractive graphs
• The lexicographic product of graphs
• Endomorphism-regularity of split graphs

This page was built for publication: Generalized symmetry of graphs - a survey