05BF5C3D-FE25-CDD2-D0B43F36A4F6028E
15F328E9-0287-A0D8-FDE517CB347CB61F
Public Events
Public Events Calendar >>

DIRECTIONS AND COLLEGE MAP

Media Relations
315-859-4680

Debra Boutin  RSS Feed

1 to 10 out of 22

Debra Boutin
Boutin Gives Talk in Slovenia

Professor of Mathematics Debra Boutin gave a research talk titled "Determining and Distinguishing Cartesian Products" at the 8th Slovenian Graph Theory Conference at Kranjska Gora, Slovenia, held June 21-27.  More ...

Debra Boutin
Boutin Publishes Research Article

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.  More ...

Debra Boutin
Boutin Presents Research in Kona, Hawaii

Professor of Mathematics Debra Boutin gave a research presentation "The Cost of Distinguishing Graphs" at the 22nd Coast Combinatorics Conference in Kona, Hawaii. In this talk, Boutin presented results on the smallest size of a set of vertices that can be used to remove all symmetries from a network.  More ...

Debra Boutin
Boutin Presents Research in Bordeaux, France

Professor of Mathematics Debra Boutin presented her work on "Distinguishing Costs for Graphs" at the Bordeaux Graph Theory Workshop in Bordeaux, France.  Boutin presented results on the smallest size of a set of vertices that can be used to remove all symmetries from a network.  More ...

Debra Boutin
Boutin Presents at Conference

Professor of Mathematics Debra Boutin gave a talk titled "Geometric Homomorphisms and the Geochromatic Number" at the Society of Industrial and Applied Mathematics Discrete Math Conference, held June 16-19 in Minneapolis.  More ...

Debra Boutin
Boutin Publishes Research Article

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.  More ...

Debra Boutin
Boutin Publishes Research Article in Electronic Journal of Combinatorics

Professor of Mathematics Debra Boutin published a research article titled “The Cost of 2-Distinguishing Cartesian Powers” in the Electronic Journal of Combinatorics.  More ...

Debra Boutin
Boutin Organizes Mini-Symposium, Gives Talk, at International Conference

Professor of Mathematics Debra Boutin organized a mini-symposium at the Society for Industrial and Applied Mathematics Conference on Discrete Mathematics in Halifax, Nova Scotia. Her mini-symposium brought together 10 mathematicians to speak about their work on graph networks and their symmetries.   More ...

Debra Boutin and Sally Cockburn
Boutin and Cockburn Publish Research Article

Professor of Mathematics Debra Boutin and Associate Professor of Mathematics Sally Cockburn published their joint work "Posets of Geometric Graphs" in Ars Mathematica Contemporanea.   More ...

Debra Boutin
Boutin Presents at Mathematical Society Conference

Professor of Mathematics Debra Boutin gave a research talk at the American Mathematical Society Southeastern Section Meeting at the University of South Florida in Tampa, Fla., on March 11. In this talk, Boutin described a set of vertices that can be used to remove all symmetries from a network and presented new results on the size of such sets in some well-known network families.  More ...

1 2 3   Next>   Last>>
Cupola