On unretractive graphs

DOI10.1016/j.endm.2005.07.078zbMath1201.05078OpenAlexW2177117004MaRDI QIDQ5899378

Roland Kaschek

Publication date: 29 May 2007

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

Full work available at URL: https://doi.org/10.1016/j.endm.2005.07.078

zbMATH Keywords

automorphism groupgraphswreath productlexicographic productunretractive graphs

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Graph operations (line graphs, products, etc.) (05C76)

Related Items (1)

Generalized symmetry of graphs - a survey

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Endomorphism spectra of graphs
• The composition of graphs
• Wreath products of monoids with small categories whose principal one- sided ideals form trees
• Endomorphisms of graphs. I: The monoid of strong endomorphisms
• Endomorphisms of graphs. II: Various unretractive graphs
• Unretractive and S-unretractive joins and lexicographic products of graphs

This page was built for publication: On unretractive graphs