## ::(-1,1,0)-adjacency matrix

### ::concepts

Redirect::

In mathematics, in graph theory, the **Seidel adjacency matrix** of a simple graph *G* (also called the **Seidel matrix** and—the original name—the (−1,1,0)-**adjacency matrix**) is the symmetric matrix with a row and column for each vertex, having 0 on the diagonal and, in the positions corresponding to vertices *v _{i}* and

*v*, −1 if the vertices are adjacent and +1 if they are not. The multiset of eigenvalues of this matrix is called the

_{j}**Seidel spectrum**. The Seidel matrix was introduced by van Lint and Seidel (1966) and extensively exploited by Seidel and coauthors. It is the adjacency matrix of the signed complete graph in which the edges of

*G*are negative and the edges not in

*G*are positive. It is also the adjacency matrix of the two-graph associated with

*G*.

The eigenvalue properties of the Seidel matrix are valuable in the study of strongly regular graphs.

**(-1,1,0)-adjacency matrix sections**

Intro

PREVIOUS: Intro | NEXT: Intro |

<< | >> |