Answers are grounded in this paper and cite their sources.
We characterize stability of graph C β C^* -algebras by giving five conditions equivalent to their stability. We also show that if G G is a graph with no sources, then C β ( G ) C^*(G) is stable if and only if each vertex in G G can be reached by an infinite number of vertices. We use this characterization to realize the stabilization of a graph C β C^* -algebra. Specifically, if G G is a graph and G ~ GΜ is the graph formed by adding a head to each vertex of G G , then C β ( G ~ ) C^*(GΜ) is the stabilization of C β ( G ) C^*(G) ; that is, C β ( G ~ ) β C β ( G ) β
No takes yet. Share an insight, caveat, or question.
Mark Tomforde (2004) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: