Professor of Mathematics Debra Boutin recently published a research article "Infinite Graphs with Finite 2-Distinguishing Cost" in the Electronic Journal of Combinatorics. In this article Boutin and her coauthor, Wilfried Imrich of Montanuniversit\"{a}t Leoben, Austria, prove that each member in a large class of infinite graphs has a very small set of nodes that can be used to obstruct all symmetry.
