On the -theory of higher rank graph -algebras.
Gwion Evans, D. (2008)
The New York Journal of Mathematics [electronic only]
Similarity:
Displaying similar documents to “Higher rank graph -algebras.”
On the -theory of higher rank graph -algebras.
Subalgebras of graph -algebras.
Hopenwasser, Alan, Peters, Justin R., Power, Stephen C. (2005)
The New York Journal of Mathematics [electronic only]
Similarity:
The graph traces of finite graphs and applications to tracial states of -algebras.
Johnson, Matthew (2005)
The New York Journal of Mathematics [electronic only]
Similarity:
Fundamental groupoids of -graphs.
Pask, David, Quigg, John, Raeburn, Iain (2004)
The New York Journal of Mathematics [electronic only]
Similarity:
Hyperidentities in transitive graph algebras
Tiang Poomsa-ard, Jeerayut Wetweerapong, Charuchai Samartkoon (2005)
Discussiones Mathematicae - General Algebra and Applications
Similarity:
Graph algebras establish a connection between directed graphs without multiple edges and special universal algebras of type (2,0). We say that a graph G satisfies an identity s ≈ t if the corresponding graph algebra A(G) satisfies s ≈ t. A graph G = (V,E) is called a transitive graph if the corresponding graph algebra A(G) satisfies the equation x(yz) ≈ (xz)(yz). An identity s ≈ t of terms s and t of any type t is called a hyperidentity of an algebra A̲ if whenever the operation symbols...
A small trivalent graph of girth 14.
Exoo, Geoffrey (2002)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Hyperidentities in associative graph algebras
Tiang Poomsa-ard (2000)
Discussiones Mathematicae - General Algebra and Applications
Similarity:
Graph algebras establish a connection between directed graphs without multiple edges and special universal algebras of type (2,0). We say that a graph G satisfies an identity s ≈ t if the correspondinggraph algebra A(G) satisfies s ≈ t. A graph G is called associative if the corresponding graph algebra A(G) satisfies the equation (xy)z ≈ x(yz). An identity s ≈ t of terms s and t of any type τ is called a hyperidentity of an algebra A̲ if whenever the operation symbols occurring in s...
The -algebras of row-finite graphs.
Bates, Teresa, Pask, David, Raeburn, Iain, Szymański, Wojciech (2000)
The New York Journal of Mathematics [electronic only]
Similarity:
Dual point-partition number of complementary graphs
Anton Kundrík (1990)
Mathematica Slovaca
Similarity:
A note on two comparability graphs
C. S., Jr. Johnson, Frederick R. McMorris (1982)
Mathematica Slovaca
Similarity:
The periphery graph of a median graph
Boštjan Brešar, Manoj Changat, Ajitha R. Subhamathi, Aleksandra Tepeh (2010)
Discussiones Mathematicae Graph Theory
Similarity:
The periphery graph of a median graph is the intersection graph of its peripheral subgraphs. We show that every graph without a universal vertex can be realized as the periphery graph of a median graph. We characterize those median graphs whose periphery graph is the join of two graphs and show that they are precisely Cartesian products of median graphs. Path-like median graphs are introduced as the graphs whose periphery graph has independence number 2, and it is proved that there are...
Pₘ-saturated bipartite graphs with minimum size
Aneta Dudek, A. Paweł Wojda (2004)
Discussiones Mathematicae Graph Theory
Similarity:
A graph G is said to be H-saturated if G is H-free i.e., (G has no subgraph isomorphic to H) and adding any new edge to G creates a copy of H in G. In 1986 L. Kászonyi and Zs. Tuza considered the following problem: for given m and n find the minimum size sat(n;Pₘ) of Pₘ-saturated graph of order n. They gave the number sat(n;Pₘ) for n big enough. We deal with similar problem for bipartite graphs.