Related papers: When universal edge-colored directed graph $C^*$-a…

Let E be a row-finite directed graph. We prove that there exists a C*-algebra C*_{min}(E) with the following co-universal property: given any C*-algebra B generated by a Toeplitz-Cuntz-Krieger E-family in which all the vertex projections…

In this paper we describe an operation on directed graphs which produces a graph with fewer vertices, such that the C*-algebra of the new graph is Morita equivalent to that of the original graph. We unify and generalize several related…

In this paper, we present a foundation study for proper colouring of edge-set graphs. The authors consider that a detailed study of the colouring of edge-set graphs corresponding to the family of paths is best suitable for such foundation…

We prove that the graph C*-algebra $C^*(E)$ of a trimmable graph $E$ is $U(1)$-equivariantly isomorphic to a pullback C*-algebra of a subgraph C*-algebra $C^*(E'')$ and the C*-algebra of functions on a circle tensored with another subgraph…

We prove that unital graph C*-algebras often admit a convenient decomposition into amalgamated free products. We use this to give a complete characterization of when a unital graph C*-algebra is residually finite-dimensional and when it is…

For a finitely aligned k-graph $\Lambda$ with X a set of vertices in $\Lambda$ we define a universal C*-algebra called $C^*(\Lambda,X)$ generated by partial isometries. We show that $C^*(\Lambda,X)$ is isomorphic to the corner…

We describe a class of $C^*$-algebras which simultaneously generalise the ultragraph algebras of Tomforde and the shift space $C^*$-algebras of Matsumoto. In doing so we shed some new light on the different $C^*$-algebras that may be…

For an arbitrary countable directed graph E we show that the only possible values of the stable rank of the associated Cuntz-Krieger algebra C*(E) are 1, 2 or \infty. Explicit criteria for each of these three cases are given. We…

Pure infiniteness (in sense of E.Kirchberg and M.R{\o}rdam) is considered for C*-algebras arising from singly generated dynamical systems. In particular, Cuntz-Krieger algebras and their generalizations, i.e., graph-algebras and O_A of an…

In this paper we study the C*-algebras associated to continuous fields over locally compact metrisable zero dimensional spaces whose fibers are Kirchberg C*-algebras satisfying the UCT. We show that these algebras are inductive limits of…

We study the class of simple graphs $\mathcal{G}^*$ for which every pair of distinct odd cycles intersect in at most one edge. We give a structural characterization of the graphs in $\mathcal{G}^*$ and prove that every $G \in \mathcal{G}^*$…

We show that certain extensions of classifiable C*-algebra are strongly classified by the associated six-term exact sequence in K-theory together with the positive cone of K_{0}-groups of the ideal and quotient. We apply our result to give…

To any directed graph we associate an algebra with edges of the graph as generators and with relations defined by all pairs of directed paths with the same origin and terminus. Such algebras are related to factorizations of polynomials over…

We provide a complete classification of the class of unital graph $C^*$-algebras - prominently containing the full family of Cuntz-Krieger algebras - showing that Morita equivalence in this case is determined by ordered, filtered…

We introduce a divisibility-type condition for directed graphs that is necessary for $\mathcal{Z}$-stability of the corresponding graph $C^*$-algebra. We prove that this condition is sufficient if either the graph $E$ has no cycles or the…

We introduce a graph theoretic property called Condition (N) for finitely separated graphs and prove that it is equivalent to both nuclearity and exactness of the associated universal tame graph C*-algebra.

For every finite dimensional Lie supergroup $(G,\mathfrak g)$, we define a $C^*$-algebra $\mathcal A:=\mathcal A(G,\mathfrak g)$, and show that there exists a canonical bijective correspondence between unitary representations of…

A functor from the category of directed trees with inclusions to the category of commutative C*-algebras with injective *-homomorphisms is constructed. This is used to define a functor from the category of directed graphs with inclusions to…

A directed graph $D$ is singly connected if for every ordered pair of vertices $(s,t)$, there is at most one path from $s$ to $t$ in $D$. Graph orientation problems ask, given an undirected graph $G$, to find an orientation of the edges…

Motivated by investigations of rainbow matchings in edge colored graphs, we introduce the notion of color-line graphs that generalizes the classical concept of line graphs in a natural way. Let $H$ be a (properly) edge-colored graph. The…