Faculty Advisor

Christopher, Peter R.

Abstract

The fixing number of a graph is the order of the smallest subset of its vertex set such that assigning distinct labels to all of the vertices in that subset results in the trivial automorphism; this is a recently introduced parameter that provides a measure of the non-rigidity of a graph. We provide a survey of elementary results about fixing numbers. We examine known algorithms for computing the fixing numbers of graphs in general and algorithms which are applied only to trees. We also present and prove the correctness of new algorithms for both of those cases. We examine the distribution of fixing numbers of various classifications of graphs.

Publisher

Worcester Polytechnic Institute

Date Accepted

April 2011

Major

Computer Science

Major

Mathematical Sciences

Project Type

Major Qualifying Project

Accessibility

Unrestricted

Advisor Department

Mathematical Sciences

Share

COinS