Sarah Reznikoff

  • Citations Per Year
Learn More
We introduce a certain natural abelian C*-subalgebra of a graph C*-algebra, which has functorial properties that can be used for characterizing injectivity of representations of the ambient C*-algebra. In particular, a short proof of the Cuntz-Krieger Uniqueness Theorem, for graphs that may have loops without entries, is given. Graph C*-algebras are(More)
A (1,≤ 2)-identifying code is a subset of the vertex set C of a graph such that each pair of vertices intersects C in a distinct way. This has useful applications in locating errors in multiprocessor networks and threat monitoring. At the time of writing, there is no simply-stated rule that will indicate if a graph is (1,≤ 2)-identifiable. As such, we(More)
  • 1