Unretractive and S-unretractive joins and lexicographic products of graphs

DOI10.1002/jgt.3190110316zbMath0659.05055OpenAlexW2137694135MaRDI QIDQ3808116

Ulrich Knauer

Publication date: 1987

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.3190110316

zbMATH Keywords

endomorphismsjoinlexicographic product

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Graph theory (05C99)

Related Items

Wreath products of acts over monoids. I: Regular and inverse acts ⋮ Homomorphically full graphs ⋮ On End-regular graphs ⋮ Graphs with a regular endomorphism monoid ⋮ On unretractive graphs ⋮ Endomorphism spectra of graphs ⋮ The core of a graph ⋮ On unretractive graphs ⋮ On wreathed lexicographic products of graphs ⋮ Naturally ordered strong endomorphisms on graphs ⋮ Endomorphisms of graphs. I: The monoid of strong endomorphisms ⋮ Endomorphisms of graphs. II: Various unretractive graphs ⋮ Unnamed Item ⋮ Generalized symmetry of graphs - a survey ⋮ Core-like properties of infinite graphs and structures ⋮ Generalized symmetry of graphs

Cites Work

• On Rigid Undirected Graphs
• Unnamed Item