Endomorphism breaking in graphs

zbMath1300.05100arXiv1311.6972MaRDI QIDQ405090

Wilfried Imrich, Florian Lehner, Rafał Kalinowski, Monika Pilśniak

Publication date: 4 September 2014

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1311.6972

zbMATH Keywords

endomorphismsinfinite graphsdistinguishing number

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Coloring of graphs and hypergraphs (05C15) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Ordinal and cardinal numbers (03E10) Infinite graphs (05C63)

Related Items (5)

Number of colors needed to break symmetries of a graph by an arbitrary edge coloring ⋮ Distinguishing threshold of graphs ⋮ The list distinguishing number of Kneser graphs ⋮ Distinguishing graphs by edge-colourings ⋮ The distinguishing index of infinite graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Distinguishability of infinite groups and graphs
• Distinguishing maps
• On the minimum order of graphs with given semigroup
• The distinguishing chromatic number
• Distinguishability of locally finite trees
• A note on the asymptotic and computational complexity of graph distinguishability
• Symmetry breaking in graphs
• Distinguishing infinite graphs
• The distinguishing number of Cartesian products of complete graphs
• Distinguishing labellings of group action on vector spaces and graphs
• Motion and distinguishing number two
• Distinguishing graphs with infinite motion and nonlinear growth
• Asymmetric graphs

This page was built for publication: Endomorphism breaking in graphs