 |
Prof. Tero Harju: Transitivity of graph operations
Transitivity questions of operations play a central role in many problems in
mathematics. In the talk I will consider two rather
restricted local operations, namely Seidel switching and local
complementation, of finite graphs.
It is shown that various compositions of these operations form
transitive groups. In particular, there is a composition of 13
switchings and local complementations that (absolutely) complements
any given graph.
Falls dieser Text Formeln enthält, die nicht dargestellt werden können,
finden Sie hier die dvi- bzw. die
pdf-Version.
|