|
Sibirskie Èlektronnye Matematicheskie Izvestiya [Siberian Electronic Mathematical Reports], 2008, Volume 5, Pages 151–176
(Mi semr96)
|
|
|
|
This article is cited in 6 scientific papers (total in 6 papers)
Research papers
Orthogonal systems in finite graphs
A. J. Duncana, I. V. Kazachkovb, V. N. Remeslennikovc a School of Mathematics and Statistics, University of Newcastle, Newcastle upon Tyne
b Department of Mathematics and Statistics, McGill University
c Omsk Branch of Mathematical Institute SB RAS
Abstract:
To a finite graph there corresponds a free partially commutative group: with the given graph as commutation graph. In this paper we construct an orthogonality theory for graphs and their corresponding free partially commutative groups. The theory developed here provides tools for the study of the structure of partially commutative groups, their universal theory and automorphism groups. In particular the theory is applied in this paper to the centraliser lattice of such groups.
Received March 1, 2008, published March 31, 2008
Citation:
A. J. Duncan, I. V. Kazachkov, V. N. Remeslennikov, “Orthogonal systems in finite graphs”, Sib. Èlektron. Mat. Izv., 5 (2008), 151–176
Linking options:
https://www.mathnet.ru/eng/semr96 https://www.mathnet.ru/eng/semr/v5/p151
|
Statistics & downloads: |
Abstract page: | 371 | Full-text PDF : | 89 | References: | 63 |
|