Back to search

North Dakota State University

Colorings of Zero-Divisor Graphs of Commutative Rings

Abstract

dc:description.abstract

We 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.

Degree

thesis:*
Grantor dc:publisher
North Dakota State University
Year dc:date.issued
2015

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Ramos, Rebecca Elizabeth

Subjects

dc:subject × 3

Rights

dc:rights
Statement dc:rights
  • NDSU Policy 190.6.2

Identifiers

dc:identifier.*
Handle dc:identifier.uri
https://hdl.handle.net/10365/25209

Chain of custody

source
Harvested from
North Dakota State University
Base URL
library.ndsu.edu/server/oai/request
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
citation

Ramos, Rebecca Elizabeth. Colorings of Zero-Divisor Graphs of Commutative Rings. North Dakota State University, 2015. https://hdl.handle.net/10365/25209