Professor of Mathematics Debra Boutin published a research article titled “The Cost of 2-Distinguishing Cartesian Powers” in the Electronic Journal of Combinatorics. In this article, Boutin presents results on a set of vertices that can be used to remove all symmetries from a network. These results give tight upper and lower bounds on the size of these set for a large group of network families.