a1 Department of Mathematics, Lafayette College, Easton, PA 18042, U.S.A. firstname.lastname@example.org
Given a finite (connected) simplicial graph with groups assigned to the vertices, the graph product of the vertex groups is the free product modulo the relation that adjacent groups commute. The graph product of finitely presented infinite groups is both semistable at infinity and quasi-simply filtrated. Explicit bounds for the isoperimetric inequality and isodiametric inequality for graph products is given, based on isoperimetric and isodiametric inequalities for the vertex groups.
(Received June 11 1993)