Graduation Year
2008
Document Type
Open Access Senior Thesis
Degree Name
Bachelor of Science
Department
Mathematics
Reader 1
David Bachman
Reader 2
Francis Edward Su
Abstract
An analog to intrinsic linking, intrinsic even linking, is explored in the first half of this paper. Four graphs are established to be minor minimal intrinsically even linked, and it is conjectured that they form a complete minor minimal set. Some characterizations are given, using the simplest of the four graphs as an integral part of the arguments, that may be useful in proving the conjecture. The second half of this paper investigates a new approach to intrinsic knotting. By adapting knot energy to graphs, it is hoped that intrinsic knotting can be detected through direct computation. However, graph energies are difficult to compute, and it is unclear whether they can be used to determine whether a graph is intrinsically knotted.
Recommended Citation
Kozai, Kenji, "Intrinsic Linking and Knotting of Graphs" (2008). HMC Senior Theses. 207.
https://scholarship.claremont.edu/hmc_theses/207
