The distinguishing index of infinite graphs

zbMath1310.05147MaRDI QIDQ2341071

Izak Broere, Monika Pilśniak

Publication date: 22 April 2015

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

Full work available at URL: http://www.combinatorics.org/ojs/index.php/eljc/article/view/v22i1p78

zbMATH Keywords

automorphisminfinite graphedge colouringcountable graphdistinguishing indexinfinite motion lemma

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Coloring of graphs and hypergraphs (05C15) Infinite graphs (05C63)

Related Items (9)

Bounds for distinguishing invariants of infinite graphs ⋮ Number of colors needed to break symmetries of a graph by an arbitrary edge coloring ⋮ Breaking graph symmetries by edge colourings ⋮ The distinguishing index of graphs with infinite minimum degree ⋮ A bound for the distinguishing index of regular graphs ⋮ Edge motion and the distinguishing index ⋮ Distinguishing graphs of maximum valence 3 ⋮ The distinguishing index of connected graphs without pendant edges ⋮ On symmetries of edge and vertex colourings of graphs

Cites Work

• Endomorphism breaking in graphs
• Distinguishability of infinite groups and graphs
• Distinguishing graphs by edge-colourings
• Edge motion and the distinguishing index
• Distinguishing maps
• Distinguishability of locally finite trees
• A note on the asymptotic and computational complexity of graph distinguishability
• Symmetry breaking in graphs
• Infinite motion and 2-distinguishability of graphs and groups
• Distinguishing infinite graphs
• Distinguishing graphs with infinite motion and nonlinear growth
• Universal graphs and universal functions

This page was built for publication: The distinguishing index of infinite graphs