Debra Boutin, associate professor of mathematics, has published "Using determining sets to distinguish Kneser graphs," co-authored with Michael Albertson, in the Electronic Journal of Combinatorics. This paper establishes the distinguishing number of each graph in a well-known family called Kneser graphs. The paper proves that (with only one notable exception) every Kneser graph can have its vertices colored with one of two colors in such a way that the resulting colored graph has no symmetry. The proof was accomplished using the determining sets that Boutin defined and studied in a previous research article.
