Stability of C*-algebras associated to graphs

Abstract

We characterize stability of graph C*-algebras by giving five conditions equivalent to their stability. We also show that if G is a graph with no sources, then C*(G) is stable if and only if each vertex in G can be reached by an infinite number of vertices. We use this characterization to realize the stabilization of a graph C*-algebra. Specifically, if G is a graph and F is the graph formed by adding a head to each vertex of G, then C*(F) is the stabilization of C*(G).

9 pages

References in corpus (1)

• The C*-algebras of arbitrary graphs

Cited by in corpus (5)

• Equivalence and stable isomorphism of groupoids, and diagonal-preserving stable isomorphisms of graph C*-algebras and Leavitt path algebras
• Diagonal-preserving gauge-invariant isomorphisms of graph $C^{\ast }$-algebras
• Flow equivalence and orbit equivalence for shifts of finite type and isomorphism of their groupoids
• Orbit equivalence of graphs and isomorphism of graph groupoids
• Orbit equivalence of higher-rank graphs