Seidel adjacency matrix

In mathematics, in graph theory, the Seidel adjacency matrix of a simple graph G (also called the Seidel matrix andthe original namethe (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 vi and vj, 1 if the vertices are adjacent and +1 if they are not. The multiset of eigenvalues of this matrix is called the 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.

See also

References


This article is issued from Wikipedia - version of the Tuesday, August 26, 2014. The text is available under the Creative Commons Attribution/Share Alike but additional terms may apply for the media files.