Show simple item record

dc.contributor.authorRamos, Rebecca Elizabeth
dc.description.abstractWe will focus on Beck’s conjecture that the chromatic number of a zero-divisor graph of a ring R is equal to the clique number of the ring R. We begin by calculating the chromatic number of the zero-divisor graphs for some finite rings and characterizing rings whose zero-divisor graphs have finite chromatic number, known as colorings. We will discuss some properties of colorings and elements called separating elements, which will allow us to determine that Beck’s conjecture holds for rings that are principal ideal rings and rings that are reduced. Then we will characterize the finite rings whose zero-divisor graphs have chromatic number less than or equal to four. In the general case, we will discuss a local ring that serves as a counterexample to Beck’s conjecture.en_US
dc.publisherNorth Dakota State Universityen_US
dc.rightsNDSU Policy 190.6.2
dc.titleColorings of Zero-Divisor Graphs of Commutative Ringsen_US
dc.typeMaster's paperen_US
dc.date.accessioned2015-07-31T13:24:56Z
dc.date.available2015-07-31T13:24:56Z
dc.date.issued2015
dc.identifier.urihttp://hdl.handle.net/10365/25209
dc.subject.lcshCommutative rings.en_US
dc.subject.lcshGraph theory.en_US
dc.subject.lcshDivisor theory.en_US
dc.rights.urihttps://www.ndsu.edu/fileadmin/policy/190.pdf
ndsu.degreeMaster of Science (MS)en_US
ndsu.collegeScience and Mathematicsen_US
ndsu.departmentMathematicsen_US
ndsu.programMathematicsen_US
ndsu.advisorDuncan, Benton


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record