On C*-nuclearity of graph operator systems

Source abstract

We classify the set of finite simple undirected graphs whose corresponding graph operator system is C*-nuclear. We prove that the operator system associated to the graph is C*-nuclear if and only if the graph is 2-chordal, as defined by McCullough. In particular, we present the first known example of a non-chordal graph whose graph operator system is C*-nuclear, as well as the first known examples of graph operator systems which are not C*-nuclear.