91B0FBB4-04A9-D5D7-16F0F3976AA697ED
C9A22247-E776-B892-2D807E7555171534
Debra Boutin
Debra Boutin

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.

Posted April 6, 2013

Help us provide an accessible education, offer innovative resources and programs, and foster intellectual exploration.

Site Search