C O ] 9 F eb 2 00 7 Enumerating the Classes of Local Equivalency in Graphs

There are local operators on (labeled) graphs G with labels (gij) coming from a finite field. If the filed is binary (in other words, if the graph is ordinary), the operations are just the local complementations, but in the general case, there are two different types of operators. The first type is the following: let v be a vertex of the graph and a ∈ Fq… CONTINUE READING