graph product of groups
Let be a finite undirected graph and let be a collection of groups associated with the vertices of . Then the graph product
of the groups is the group , where is the free product of the and is generated by the relations
that elements of commute with elements of whenever and are adjacent in .
The free product and the direct product are the extreme examples of the graph product. To obtain the free product, let be an anticlique, and to obtain the direct product, let be a clique.
References
- 1 E.R. Green, Graph products of groups, Doctoral thesis, The University of Leeds, 1990.
- 2 S. Hermiller and J. Meier, Algorithms and geometry for graph products of groups, Journal of Algebra 117 (1995), 230–257.
- 3 M. Lohrey and G. Sénizergues, When is a graph product of groups virtually-free?, to appear in Communications in Algebra. 2006 preprint available online at http://inf.informatik.uni-stuttgart.de/fmi/ti/personen/Lohrey/05-Graphprod.pdf.
- 4 R.Brown, M. Bullejos, and T. Porter,‘Crossed complexes, freecrossed resolutions and graph products of groups’, ProceedingsWorkshop Korea 2000, J. Mennicke, Moo Ha Woo (eds.) RecentAdvances in Group Theory, Heldermann Verlag Research andExposition in Mathematics 27 (2002) 8–23. arXiv:math/0101220