DOI
https://doi.org/10.25772/CPH8-MZ02
Defense Date
2014
Document Type
Thesis
Degree Name
Master of Science
Department
Mathematical Sciences
First Advisor
Richard Hammack
Abstract
A cancellation graph G is one for which given any graph C, we have G\times C\cong X\times C implies G\cong X. In this thesis, we characterize all bipartite cancellation graphs. In addition, we characterize all solutions X to G\times C\cong X\times C for bipartite G. A characterization of non-bipartite cancellation graphs is yet to be found. We present some examples of solutions X to G\times C\cong X\times C for non-bipartite G, an example of a non-bipartite cancellation graph, and a conjecture regarding non-bipartite cancellation graphs.
Rights
© The Author
Is Part Of
VCU University Archives
Is Part Of
VCU Theses and Dissertations
Date of Submission
May 2014