Theodore Koss, “Counting Arithmetical Structures on Coconut Trees” Mentor: Pamela Harris, Mathematical Sciences Poster #111 If G is a finite and connected graph, then an arithmetical structure on G is a pair of vectors (d, r) with positive integer entries…… Read More
Jillian Cervantes, “Optimal Resource Placement: Dominating Sets for a Family of Semiregular Tiling Graphs” Mentor: Pamela Harris, Mathematical Sciences Poster #220 Let G = (V, E) be a simply connected undirected finite graph with vertex set V and edge set…… Read More
Stephen Lasinis, “Pinnacles on Graphs” Mentor: Pamela Harris, Mathematical Sciences Poster #176 Given a simple connected graph G with n vertices and a bijective labeling of the vertices using the integers [n] = {1, 2, . . . , n},…… Read More