A two-graph is equivalent to a switching class of graphs and also to a (signed) switching class of signed complete graphs.
In the standard construction of a two-graph from a simple graph given above, two graphs will yield the same two-graph if and only if they are equivalent under switching, that is, they are in the same switching class.