Department or Program
Primary Wellesley Thesis Advisor
We introduce Anderson's and Livingston's definition of a zero-divisor graph of a commutative ring. We then redefine their definition to include looped vertices, enabling us to visualize nilpotent elements. With this new definition, we examine the algebraic and graph theoretic properties of different types of Artinian rings, culminating in an algorithm that determines the corresponding Artinian rings to a zero-divisor graph. We also will explore and develop an algorithm for a specific case of Artinian rings, and we will conclude by examining the uniqueness of zero-divisor graphs.