Prefer a chat interface with context about you and your work?
Remarks on some fundamental results about higher-rank graphs and their <i>C</i>*-algebras
Abstract Results of Fowler and Sims show that every k -graph is completely determined by its k -coloured skeleton and collection of commuting squares. Here we give an explicit description of the k -graph associated with a given skeleton and collection of squares and show that two k -graphs are …