Related papers: Refinement of Higher-Rank Graph Reduction

In this paper we introduce and study a new graph invariant derived from the degree sequence of a graph $G$, called the sub-$k$-domination number and denoted $sub_k(G)$. We show that $sub_k(G)$ is a computationally efficient sharp lower…

To a higher rank directed graph $(\Lambda, d)$, in the sense of Kumjian and Pask, one can associate natural noncommutative analytic Toeplitz algebras, both weakly closed and norm closed. We introduce methods for the classification of these…

A categorical formalism for directed graphs is introduced, featuring natural notions of morphisms and subgraphs, and leading to two elementary descriptions of the free-properad monad, first in terms of presheaves on elementary graphs,…

The notion of degree-constrained spanning hierarchies, also called k-trails, was recently introduced in the context of network routing problems. They describe graphs that are homomorphic images of connected graphs of degree at most k. First…

We prove that if \Lambda is a row-finite k-graph with no sources, then the associated C^*-algebra is simple if and only if \Lambda is cofinal and satisfies Kumjian and Pask's Condition (A). We prove that Condition (A) is equivalent to a…

We show that the long exact sequence for K-groups of Leavitt path algebras deduced by Ara, Brustenga, and Cortinas extends to Leavitt path algebras of countable graphs with infinite emitters in the obvious way. Using this long exact…

It is now well known that a simple graph $C^*$-algebra $C^*(E)$ of a directed graph $E$ is either AF or purely infinite. In this paper, we address the question of whether this is the case for labeled graph $C^*$-algebras recently introduced…

Higher-rank graphs were introduced by Kumjian and Pask to provide models for higher-rank Cuntz-Krieger algebras. In a previous paper, we constructed 2-graphs whose path spaces are rank-two subshifts of finite type, and showed that this…

k-graphs are higher-rank analogues of directed graphs which were first developed to provide combinatorial models for operator algebras of Cuntz-Krieger type. Here we develop a theory of the fundamental groupoid of a k-graph, and relate it…

There has been a great deal of attention recently to graphs whose vertex set is a group, defined using the group structure. (The commuting graph, where two elements are joined if they commute, is the oldest and most famous example.) The…

We propose to study transformations on graphs, and more generally structures, by looking at how the cut-rank (as introduced by Oum) of subsets is affected when going from the input structure to the output structure. We consider…

We introduce a reducibility on classes of structures, essentially a uniform enumeration reducibility. This reducibility is inspired by the Friedman-Stanley paper on using Borel reductions to compare classes of countable structures. This…

Graph classes of bounded tree rank were introduced recently in the context of the model checking problem for first-order logic of graphs. These graph classes are a common generalization of graph classes of bounded degree and bounded…

A vertex ranking of a graph is an assignment of ranks (or colors) to the vertices of the graph, in such a way that any simple path connecting two vertices of equal rank, must contain a vertex of a higher rank. In this paper we study a…

Graph reordering is a powerful technique to increase the locality of the representations of graphs, which can be helpful in several applications. We study how the technique can be used to improve compression of graphs and inverted indexes.…

Inspired by Franks' classification of irreducible shifts of finite type we provide a short list of allowed moves on graphs that preserves the stable isomorphism class of the associated C*-algebras. We show that if two graphs have stably…

We introduce techniques for proving uniform termination of graph transformation systems, based on matrix interpretations for string rewriting. We generalize this technique by adapting it to graph rewriting instead of string rewriting and by…

We investigate $C^*$-algebras associated with row-finite topological higher-rank graphs with no source, which are based on product system $C^*$-algebras. We prove the Cuntz-Krieger uniqueness theorem, and provide the condition of simplicity…

We introduce a general class of algorithms and supply a number of general results useful for analysing these algorithms when applied to regular graphs of large girth. As a result, we can transfer a number of results proved for random…

In a classic paper, Gerstenhaber showed that first order deformations of an associative k-algebra A are controlled by the second Hochschild cohomology group of A. More generally, any n-parameter first order deformation of A gives, due to…