The size of switching classes with skew gains
Graphs in which each edge has a gain (a label from a group so that reversing the direction inverts the gain) are said to be gain graphs. The gain graphs considered in this paper have the property that the gain of an edge is related to the gain of the reverse edge by an anti-involution. Such graphs are said to be skew gain graphs. The authors consider the problem of computing the size of equivalence classes related to a generalization of Seidel switching of an undirected graph. At first the problem is solved for complete graphs. Then the general problem is solved by reduction to the class of complete graphs and bipartite graphs, respectively.
scientific article; zbMATH DE number 1439825