Show simple item record

dc.contributor.advisorSmucker, Russell
dc.contributor.advisorJohnson, Mark
dc.contributor.authorFrohman, Charles Dale
dc.description51 p.en_US
dc.description.abstractWe have shown that to identify a generating set of the automorphism group of a graph with n vertices, we only need to test the circlical nonseparable basic permutations of Sn that do not consist of a single cycle of order greater than 2, and the nonseparable involutions of Sn. We have also shown that it is possible to determine the automorphism group of certain graphs by investigating the local automorphisms. We have also proved several theorems that could be applicable to the problem of determining the necessary and sufficient conditions that an abstract group be equivalent to the auto,morphism group of some graph. We have by no means exhausted the set of results that could be proved in the directions that this paper has taken. The most fertile areas seem to be the ones investigated in section 5 and Section 6. Neither have we found the most efficient algorithm for determining the automorphism group of a graph. We have made a good start though. The proof of results in graph theory usually entails the investigation of many cases and subcases. Subsequently the results come very slowly and there are many conjectures that seem reasonable but take a long time to discredit. From the point of view of the researcher I would say that theorems 1, 2 and 4 were the key results that allowed me to come up with the others.en_US
dc.description.abstractMissing page 19.
dc.description.sponsorshipUpjohn Company. Kalamazoo, Michigan.
dc.publisherKalamazoo Collegeen_US
dc.relation.ispartofKalamazoo College Mathematics Senior Individualized Projects Collection
dc.relation.ispartofseriesSenior Individualized Projects. Mathematics.;
dc.rightsU.S. copyright laws protect this material. Commercial use or distribution of this material is not permitted without prior written permission of the copyright holder.
dc.titleThe Automorphism Groups of Graphsen_US
KCollege.Access.ContactIf you are not a current Kalamazoo College student, faculty, or staff member, email to request access to this thesis.

Files in this item


This item appears in the following Collection(s)

  • Mathematics Senior Individualized Projects [249]
    This collection includes Senior Individualized Projects (SIP's) completed in the Mathematics Department. Abstracts are generally available to the public, but PDF files are available only to current Kalamazoo College students, faculty, and staff.

Show simple item record