1 citations · 1 across the 1 of their papers we have counts for
2 papers
math.CO2018
Distinguishing density and the Distinct Spheres Condition
Wilfried Imrich, Florian Lehner, Simon M. Smith
If a graph has distinguishing number 2, then there exists a partition of its vertex set into two parts, such that no nontrivial automorphism of fixes setwise the two parts.…
math.CO2013★ 1 cited
Bounding the distinguishing number of infinite graphs
Simon M. Smith, Mark E. Watkins
A group of permutations G of a set V is k-distinguishable if there exists a partition of V into k parts such that only the identity permutation in G fixes setwise all of the cells…