Ext classes and embeddings for \(C^*\)-algebras of graphs with sinks (Q5949339)

A directed graph \(G=(G^0,G^1,r,s)\) consists of a countable set \(G^0\) of vertices, a countable set \(G^1\) of edges, and maps \(r,s:G^1 \to G^0\) which identify the range and source of each edge. A vertex \(v \in G^0\) is called a sink if \(s^{-1}(v)=\emptyset .\) A graph is row-finite if \(s^{-1}(v)\) is finite for all \(v \in G^0.\) If \(G\) is a row-finite directed graph, a Cuntz-Kriger \(G\)-family in a \(C^*\)-algebra is a set of mutually orthogonal projections \(\{p_v:v\in G^0\}\) together with a set of partial isometries \(\{s_e:e\in G^1\}\) which satisfy the Cuntz-Kriger relations: \(s_e^*s_e=p_{r(e)}\) for \(e\in G^1\) and \(p_v=\sum _{e:s(e)=v}s_es_e^*\) whenever \(v\in G^0\) is not a sink. Then \(C^*(G)\) is defined to be the \(C^*\)-algebra generated by the universal Cuntz-Kriger \(G\)-family. NEWLINENEWLINENEWLINELet us consider directed graphs \(E\) obtained by adding a sink to a fixed graph \(G.\) The purpose of the paper is to associate an element of \(\text{Ext}(C^*(G))\) to each such \(E,\) and to show that the classes of two such graphs are equal in \(\text{Ext}(C^*(G))\) iff the associated \(C^*\)-algebra of one can be embedded as a full corner in the \(C^*\)-algebra of the other in a particular way. This result is applied to generalize some known classification theorems for \(C^*\)-algebras of graphs with sinks.