Date of Defense
Gary Chartrand, Mathematics and Statistics
Arthur White, Mathematics and Statistics
S.F. Kapoor, Mathematics and Statistics
The induced rotation number ih(G) of a graph G is the minimum order of a graph F such that for every vertex x of G and every vertex y of F, there exists an embedding of G as an induced subgraph of F with x at y. It is shown that ih(G) is defined for every graph G and that the induced rotation number of a graph and its complement are equal. The induced rotation ratio ir(G) of a graph G is defined as the ratio ih(G)/|V(G)|. We show that for every rational number r ∈ [1,2), there exists a graph G for which ir(G)=r. The induced rotation number is extended to two or more graphs and discussed.
Gavlas, Heather Jordan, "Induced Rotation Numbers of Graphs" (1990). Honors Theses. 266.
Honors Thesis-Campus Only