9786131156816 - Seidel Adjacency Matrix: Mathematics, Graph Theory, Simple Graph, Symmetric Matrix, Eigenvalue, Signed Graph (3 risultati)

Taschenbuch. Condizione: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -High Quality Content by WIKIPEDIA articles! High Quality Content by WIKIPEDIA articles! 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. 76 pp. Englisch.

Taschenbuch. Condizione: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - High Quality Content by WIKIPEDIA articles! High Quality Content by WIKIPEDIA articles! 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.

Taschenbuch. Condizione: Neu. This item is printed on demand - Print on Demand Titel. Neuware -Please note that the content of this book primarily consists of articlesavailable from Wikipedia or other free sources online. In mathematicsin graph theory, the Seidel adjacency matrix of a simple graph G (alsocalled the Seidel matrix and-the original name-the (¿1,1,0)-adjacencymatrix) is the symmetric matrix with a row and column for each vertexhaving 0 on the diagonal and, in the positions corresponding to verticesvi and vj, ¿1 if the vertices are adjacent and +1 if they are not. Themultiset of eigenvalues of this matrix is called the Seidel spectrum.The Seidel matrix was introduced by van Lint and Seidel (1966) andextensively exploited by Seidel and coauthors. It is the adjacencymatrix of the signed complete graph in which the edges of G are negativeand the edges not in G are positive. It is also the adjacency matrix ofthe two-graph associated with G.VDM Verlag, Dudweiler Landstraße 99, 66123 Saarbrücken 76 pp. Englisch.