bn:03652703n
Noun Concept
Categories: Combinatorics stubs, Algebraic graph theory, Matrices
EN
Seidel adjacency matrix  (-1,1,0)-adjacency matrix  Seidel matrix
EN
In mathematics, in graph theory, the Seidel adjacency matrix of a simple undirected graph G is a symmetric matrix with a row and column for each vertex, having 0 on the diagonal, −1 for positions whose rows and columns correspond to adjacent vertices, and +1 for positions corresponding to non-adjacent vertices. Wikipedia
Definitions
Relations
Sources
EN
In mathematics, in graph theory, the Seidel adjacency matrix of a simple undirected graph G is a symmetric matrix with a row and column for each vertex, having 0 on the diagonal, −1 for positions whose rows and columns correspond to adjacent vertices, and +1 for positions corresponding to non-adjacent vertices. Wikipedia
Wikipedia Redirections