Sorry, we do not have enough data to show an influence graph for this author.
The operation of switching a finite graph was introduced by Seidel, in the study of strongly regular graphs. We may conveniently regard a graph as being a 2-colouring of a complete graph; then the extension to switching of an m-coloured complete graph is easy to define. However, the situation is very different. For m > 2, all m-coloured graphs lie in the… (More)