Now showing items 1-3 of 3

    • Colorings of Zero-Divisor Graphs of Commutative Rings 

      Ramos, Rebecca Elizabeth (North Dakota State University, 2015)
      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 ...
    • The Game of Nim on Graphs 

      Erickson, Lindsay Anne (North Dakota State University, 2011)
      The ordinary game of Nim has a long history and is well-known in the area of combinatorial game theory. The solution to the ordinary game of Nim has been known for many years and lends itself to numerous other solutions ...
    • The Square of Adjacency Matrices 

      Kranda, Daniel Joseph (North Dakota State University, 2011)
      It can be shown that any symmetric (0, 1)-matrix A with tr A = 0 can be interpreted as the adjacency matrix of a simple, finite graph. The square of an adjacency matrix A2 = (si1) has the property that Sij represents the ...