Professor of Mathematics Debra Boutin published a research article titled "The Cost of 2-Distinguishing Selected Kneser Graphs and Hypercubes" in the Journal of Combinatorial Mathematics and Combinatorial Computing. 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 the exact size of these set for two well-known network families.
