Two-graph

From Wikipedia, the free encyclopedia

In mathematics, a two-graph is a set of (unordered) triples chosen from a finite vertex set X, such that every (unordered) quadruple from X contains an even number of triples of the two-graph. A regular two-graph has the property that every pair of vertices lies in the same number of triples of the two-graph. Two-graphs have been studied because of their connection with equiangular lines and, for regular two-graphs, strongly regular graphs, and also finite groups because many regular two-graphs have interesting automorphism groups.

A two-graph should not be confused with other objects called 2-graphs in graph theory, such as 2-regular graphs.

[edit] Switching and graphs

A two-graph is equivalent to a switching class of graphs and also to a (signed) switching class of signed complete graphs.

Switching a set of vertices in a (simple) graph means reversing the adjacencies of each pair of vertices, one in the set and the other not in the set: thus the edge set is changed so that an adjacent pair becomes nonadjacent and a nonadjacent pair becomes adjacent. The edges whose endpoints are both in the set, or both not in the set, are not changed. Graphs are switching equivalent if one can be obtained from the other by switching. An equivalence class of graphs under switching is called a switching class. Switching was introduced by van Lint and Seidel (1966) and developed by Seidel; it has been called graph switching or Seidel switching, partly to distinguish it from switching of signed graphs.

Given a graph G, there is a corresponding two-graph on the same vertex set whose triples consist of the sets of three vertices that contain an odd number of edges of G. Two graphs yield the same two-graph if and only if they are equivalent under switching.

To a graph G there corresponds a signed complete graph Σ on the same vertex set, whose edges are signed negative if in G and positive if not in G. Conversely, G is the subgraph of Σ that consists of all vertices and all negative edges. The two-graph of G can also be defined as the set of triples of vertices that support a negative triangle in Σ. Two signed complete graphs yield the same two-graph if and only if they are equivalent under switching.

Switching of G and of Σ are related: switching the same vertices in both yields a graph H and its corresponding signed complete graph.

[edit] Adjacency matrix

The adjacency matrix of a two-graph is the adjacency matrix of any corresponding signed complete graph; thus it is symmetric, is zero on the diagonal, and has entries ±1 off the diagonal. If G is the graph corresponding to Σ, this matrix is called the (0, −1, 1)-adjacency matrix or Seidel adjacency matrix of G. The Seidel matrix is a fundamental tool in the study of two-graphs, especially regular two-graphs.

[edit] References

van Lint, J.H., and Seidel, J.J. (1966), Equilateral point sets in elliptic geometry. Indagationes Mathematicae, vol 28 (= Proc. Kon. Ned. Aka. Wet. Ser. A, vol. 69), pp. 335-348.

Taylor, D. E. Regular 2-graphs. Proceedings of the London Mathematical Society (3) 35 (1977), 257-274.

Seidel, J. J. A survey of two-graphs. In: Colloquio Internazionale sulle Teorie Combinatorie (Proceedings, Rome, 1973), Vol. I, pp. 481-511. Atti dei Convegni Lincei, No. 17. Accademia Nazionale dei Lincei, Rome, 1976.