1 citations · 1 across the 4 of their papers we have counts for
Showing 2018Show all
2 papers · 1 filter
math.CO2018
Distinguishing locally finite trees
Svenja Hüning, Wilfried Imrich, Judith Kloas +2
The distinguishing number of a graph is the smallest number of colors that is needed to color the vertices of such that the only color preserving automorphism is the…
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.…