Add to ORKGAbstract. Several relations on graphs, including primitive equivalence, ex-plosion equivalence and strong shift equivalence, are examined and shown to preserve either the graph groupoid, a construction of Kumjian, Pask, Rae-burn, and Renault, or the groupoid of a pointed version of the graph. Thus these relations preserve either the isomorphism class or the Morita equiva-lence class of the graph C∗-algebra, as defined by Kumjian, Pask, and Rae-burn
A problem of isomorphism checking of two elementary conjunctions of predicate formulas is under cons...
We prove that ample groupoids with σ-compact unit spaces are equivalent if and only if they are stab...
Let p be an odd prime. From a simple undirected graph G, through the classical procedures of Baer (1...
Using an algebraic point of view we present an introduction to the groupoid theory; that is, we give...
We initiate the program of extending to higher-rank graphs (k-graphs) the geometric classification o...
In this paper, we explore the structure of the set of all regular equivalences (White and Reitz 1983...
Two graphs G and H are Türker equivalent if they have the same set of Türker angles. In this paper...
In this paper, we explore the structure of the set of all regular equivalences (White and Reitz 1983...
Given a set S and an equivalence relation R on S, one can define an equivalence graph with vertex se...
AbstractLet P(G) denote the chromatic polynomial of a graph G. Two graphs G and H are chromatically ...
We introduce the notion of orbit equivalence of directed graphs, following Matsumoto’s notion of con...
Higher-rank graphs (k-graphs) are a combinatorial model for C*-algebras; indeed, much of the structu...
AbstractLet G be the set of finite graphs whose vertices belong to some fixed countable set, and let...
This note extends and strengthens a theorem of Bates that says that row-finite graphs that are stron...
Two graphs G and H are Turker equivalent if they have the same set of Turker angles. In this paper s...
A problem of isomorphism checking of two elementary conjunctions of predicate formulas is under cons...
We prove that ample groupoids with σ-compact unit spaces are equivalent if and only if they are stab...
Let p be an odd prime. From a simple undirected graph G, through the classical procedures of Baer (1...
Using an algebraic point of view we present an introduction to the groupoid theory; that is, we give...
We initiate the program of extending to higher-rank graphs (k-graphs) the geometric classification o...
In this paper, we explore the structure of the set of all regular equivalences (White and Reitz 1983...
Two graphs G and H are Türker equivalent if they have the same set of Türker angles. In this paper...
In this paper, we explore the structure of the set of all regular equivalences (White and Reitz 1983...
Given a set S and an equivalence relation R on S, one can define an equivalence graph with vertex se...
AbstractLet P(G) denote the chromatic polynomial of a graph G. Two graphs G and H are chromatically ...
We introduce the notion of orbit equivalence of directed graphs, following Matsumoto’s notion of con...
Higher-rank graphs (k-graphs) are a combinatorial model for C*-algebras; indeed, much of the structu...
AbstractLet G be the set of finite graphs whose vertices belong to some fixed countable set, and let...
This note extends and strengthens a theorem of Bates that says that row-finite graphs that are stron...
Two graphs G and H are Turker equivalent if they have the same set of Turker angles. In this paper s...
A problem of isomorphism checking of two elementary conjunctions of predicate formulas is under cons...
We prove that ample groupoids with σ-compact unit spaces are equivalent if and only if they are stab...
Let p be an odd prime. From a simple undirected graph G, through the classical procedures of Baer (1...