DOI
https://doi.org/10.25772/MQ90-XS50
Defense Date
2009
Document Type
Thesis
Degree Name
Master of Science
Department
Mathematical Sciences
First Advisor
Richard Hammack
Abstract
In the 1970’s, L. Lovász proved that two graphs G and H are isomorphic if and only if for every graph X , the number of homomorphisms from X → G equals the number of homomorphisms from X → H . He used this result to deduce cancellation properties of the direct product of graphs. We develop a result analogous to Lovász’s theorem, but in the class of graphs without loops and with weak homomorphisms. We apply it prove a general cancellation property for the strong product of graphs.
Rights
© The Author
Is Part Of
VCU University Archives
Is Part Of
VCU Theses and Dissertations
Date of Submission
December 2009