Master of Science in Mathematical Science
First Committee Member
Ebrahim Salehi, Chair
Second Committee Member
Third Committee Member
Graduate Faculty Representative
Number of Pages
For any element h of the Natural numbers, a graph G=(V,E), with vertex set V and edge set E, is said to be h-magic if there exists a labeling of the edge set E, using the integer group mod h such that the induced vertex labeling, the sum of all edges incident to a vertex, is a constant map. When this constant is 0 we call G a zero-sum h-magic graph. The null set of G is the set of all natural numbers h for which G admits a zero-sum h-magic labeling. A graph G is said to be uniformly null if every magic labeling of G induces zero sum. In this thesis we will identify the null sets of certain classes of Planar Graphs.
Combinatorial analysis; Combinatorics; Graph theory
Discrete Mathematics and Combinatorics | Mathematics
Hansen, Samuel M., "Zero-sum magic graphs and their null sets" (2011). UNLV Theses, Dissertations, Professional Papers, and Capstones. 1010.