dc.rights.license | In Copyright | en_US |
dc.creator | Tu, Wenda | |
dc.date.accessioned | 2014-04-18T14:37:39Z | |
dc.date.available | 2014-04-18T14:37:39Z | |
dc.date.created | 2014 | |
dc.identifier | WLURG38_Tu_MATH_2014 | |
dc.identifier.uri | http://hdl.handle.net/11021/27300 | |
dc.description | Thesis; [FULL-TEXT RESTRICTED TO WASHINGTON AND LEE UNIVERSITY LOGIN] | en_US |
dc.description | Wenda Tu is a member of the Class of 2014 of Washington and Lee University. | en_US |
dc.description.abstract | Given Zp where p is an integer prime, let's de ne G(k) p to be the digraph whose set of vertices is Zp such that there is a directed edge from a vertex a to a vertex b if ak b mod p. First, we nd our own way to decide if there is a cycle of length t in a given graph G(k) p in Zp. Later, we extend our work from Zp to Z[i]=hpi for p Gaussian primes. We found similar ways to determine the cycles in G(k) p in such Gaussian integer eld . | en_US |
dc.format.extent | 22 pages | en_US |
dc.language.iso | en_US | en_US |
dc.rights | This material is made available for use in research, teaching, and private study, pursuant to U.S. Copyright law. The user assumes full responsibility for any use of the materials, including but not limited to, infringement of copyright and publication rights of reproduced materials. Any materials used should be fully credited with the source. | en_US |
dc.rights.uri | http://rightsstatements.org/vocab/InC/1.0/ | en_US |
dc.subject.other | Washington and Lee University -- Honors in Mathematics | en_US |
dc.title | Finding Cycles In The Kth Power Diagraphs Over Integers Modulo A Prime And Over Gaussian Integers Modulo a Gaussian Prime (thesis) | en_US |
dc.type | Text | en_US |
dcterms.isPartOf | RG38 - Student Papers | |
dc.rights.holder | Tu, Wenda | |
dc.subject.fast | Numbers, Prime | en_US |
dc.subject.fast | Number theory | en_US |
dc.subject.fast | Graph theory | en_US |
local.department | Mathematics | en_US |
local.scholarshiptype | Honors Thesis | en_US |