University of British Columbia
On the minimal polynomial and authomorpism group of a graph
Abstract
dc:descriptionThis thesis discusses the use of the characteristic polynomial and minimal polynomial of the adjacency matrix of a graph to characterize its automorphism group. We first consider the reducibility of the minimal polynomial of a graph and see how this reflects the properties of the graph and its automorphism group. Then we study the relationship between the number of orbits of a subgroup of the automorphism group of a graph and the factorization of its characteristic polynomial. Finally we present an algorithm to determine the automorphism partitioning of a graph using its characteristic polynomial. Most of the results can also be extended to directed graphs and to graphs with parallel edges and loops.
Degree
thesis:*- Name thesis:degree_name
- Master of Science - MSc
- Level thesis:degree_level
- master's
- Discipline thesis:degree_discipline
- Mathematics
- Grantor dc:publisher
- University of British Columbia
- Year dc:date
- 1978
Author and committee
dc:creator, dc:contributor.*- Author dc:creator
-
- Ng, Fat-Kwong Louis
Rights
dc:rights- Statement dc:rights
-
- For non-commercial purposes only, such as research, private study and education. Additional conditions apply, see Terms of Use https://open.library.ubc.ca/terms_of_use.
- Language dc:language
- eng
Identifiers
dc:identifier.*- Handle dc:identifier
- http://hdl.handle.net/2429/20873