| dc.contributor.author | Brownlee, Erin Ann | |
| dc.description.abstract | Graph C*-algebras are constructed using projections corresponding to the vertices of the graph, and partial isometries corresponding to the edges of the graph. Here, we use the gauge-invariant uniqueness theorem to first establish that the C*-algebra of a graph composed of a directed cycle with finitely many edges emitting away from that cycle is Mn+k(C(T)), where n is the length of the cycle and k is the number of edges emitting away. We use this result to establish the main results of the thesis, which pertain to maximally edge-colored directed graphs. We show that the C*-algebra of any finite maximally edge-colored directed graph is *Mn(C){ Mn(C(T))}k, where n is the number of vertices of the graph and k depends on the structure of the graph. Finally, we show that this algebra is in fact isomorphic to Mn(*C{ C(T)}k). | en_US |
| dc.publisher | North Dakota State University | en_US |
| dc.rights | NDSU Policy 190.6.2 | |
| dc.title | Maximally Edge-Colored Directed Graph Algebras | en_US |
| dc.type | Dissertation | en_US |
| dc.date.accessioned | 2018-07-18T21:26:47Z | |
| dc.date.available | 2018-07-18T21:26:47Z | |
| dc.date.issued | 2017 | |
| dc.identifier.uri | https://hdl.handle.net/10365/28666 | |
| dc.rights.uri | https://www.ndsu.edu/fileadmin/policy/190.pdf | |
| ndsu.degree | Doctor of Philosophy (PhD) | en_US |
| ndsu.college | Science and Mathematics | en_US |
| ndsu.department | Mathematics | en_US |
| ndsu.program | Mathematics | en_US |
| ndsu.advisor | Duncan, Benton | |
