1980
DOI: 10.1016/0021-8693(80)90131-3
|View full text |Cite
|
Sign up to set email alerts
|

Graph algebras

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
38
0
1

Year Published

1982
1982
2013
2013

Publication Types

Select...
8
2

Relationship

0
10

Authors

Journals

citations
Cited by 42 publications
(40 citation statements)
references
References 0 publications
0
38
0
1
Order By: Relevance
“…The solution to the isomorphism problem has the strongest form: if G./ Š G. 0 / then Š 0 (see Droms [11] and Kim et al [20]). Servatius [26] conjectured a finite generating set for Aut.G.// and his conjecture was proved by Laurence [22].…”
Section: Introductionmentioning
confidence: 99%
“…The solution to the isomorphism problem has the strongest form: if G./ Š G. 0 / then Š 0 (see Droms [11] and Kim et al [20]). Servatius [26] conjectured a finite generating set for Aut.G.// and his conjecture was proved by Laurence [22].…”
Section: Introductionmentioning
confidence: 99%
“…PT can be regarded as the presentation of a &-algebra kT, of a monoid Mr, or of a group Fr, called a graph group. These objects have been previously studied by various authors [2][3][4][5][6][7][8].…”
mentioning
confidence: 99%
“…To a finite simple graph Γ = (V, E), there is associated a right-angled Artin group, G Γ , with a generator v for each vertex v ∈ V, and with a commutator relation vw = wv for each edge {v, w} ∈ E. The groups G Γ interpolate between the free groups F n (corresponding to the discrete graphs on n vertices, K n ), and the free abelian groups Z n (corresponding to the complete graphs on n vertices, K n ). These groups are completely determined by their underlying graphs: G Γ ∼ = G Γ ′ if and only if Γ ∼ = Γ ′ ; see [16,12]. In a previous paper [11], we settled Serre's question for the class of right-angled Artin groups: G Γ is quasi-projective iff G Γ is quasi-Kähler iff Γ is a complete multipartite graph (i.e., a join K n1,...,nr = K n1 * · · · * K nr of discrete graphs).…”
mentioning
confidence: 99%