The Cost of Distinguishing Graphs

DOI10.1017/9781316576571.005zbMath1476.05049OpenAlexW2737519387MaRDI QIDQ5365544

Wilfried Imrich, Debra L. Boutin

Publication date: 6 October 2017

Published in: Groups, Graphs and Random Walks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/9781316576571.005

zbMATH Keywords

automorphisminfinite graphdetermining setdetermining numberdistinguishing number

Mathematics Subject Classification ID

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

Related Items (5)

Paint cost and the frugal distinguishing number ⋮ Asymmetric coloring of locally finite graphs and profinite permutation groups: Tucker's conjecture confirmed ⋮ Distinguishing graphs of maximum valence 3 ⋮ The cost of 2-distinguishing hypercubes ⋮ Symmetry parameters for Mycielskian graphs

This page was built for publication: The Cost of Distinguishing Graphs