Date of Award
Bachelor of Science
Dr. Van C. Nall
In this paper we explore the existence of exactly k-to-1 continuous functions between graphs, and more specifically 2-to-1 continuous function between graphs that are irreducibly 2-to-1, meaning that no restriction of the function to a subgraph is 2-to-l. We show how to construct such functions in some general cases, and then more specifically onto rectangular grids. We have in mind an application to distributed networks and signal verification.
Parker, Susan M., "Irreducible k-to-1 Maps Onto Grids" (1997). Honors Theses. 967.