Back to search

North Dakota State University

Maximally Edge-Colored Directed Graph Algebras

Abstract

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

Degree

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

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Brownlee, Erin Ann

Rights

dc:rights
Statement dc:rights
  • NDSU Policy 190.6.2

Identifiers

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

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
related terms
citation

Brownlee, Erin Ann. Maximally Edge-Colored Directed Graph Algebras. North Dakota State University, 2017. https://hdl.handle.net/10365/28666