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 .
- 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, free crossed resolutions and graph products of groups’, Proceedings Workshop Korea 2000, J. Mennicke, Moo Ha Woo (eds.) Recent Advances in Group Theory, Heldermann Verlag Research and Exposition in Mathematics 27 (2002) 8–23. arXiv:math/0101220
|Title||graph product of groups|
|Date of creation||2013-03-22 16:10:36|
|Last modified on||2013-03-22 16:10:36|
|Last modified by||mps (409)|
|Defines||graph product of groups|