Seidel Adjacency Matrix: Mathematics, Graph Theory, Simple Graph, Symmetric Matrix, Eigenvalue, Signed Graph - Couverture souple

Couverture souple

ISBN 10 : 6131156816 ISBN 13 : 9786131156816

Editeur : Betascript Publishing, 2010

Synopsis

Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. 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 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.

Détails de l'édition

• Éditeur: Betascript Publishing
• Date d'édition: 2010
• Langue: anglais
• ISBN 10: 6131156816
• ISBN 13: 9786131156816
• Reliure: Broché
• Nombre de pages: 76
• Éditeur: Surhone Lambert M., Tennoe Mariam T., Henssonow Susan F.
• Coordonnées du fabricant: non disponible
• Personne responsable: non disponible