Skip to search formSkip to main contentSkip to account menu

Seidel adjacency matrix

Known as: (-1,1,0)-adjacency matrix, Seidel matrix 
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… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2013
2013
A Euler–Seidel matrix is determined by an infinite sequence whose elements are given by recursion. The recurrence relations are… 
2012
2012
For a simple undirected graph G, denote by A(G) the (0,1)-adjacency matrix of G. Let thematrix S(G) = J-I-2A(G) be its Seidel… 
2010
2010
We study the Euler-Seidel matrix of certain integer sequences, using the binomial transform and Hankel matrices. For moment… 
2009
2009
This work is based on EulerSeidel matrices ([8]) which is related to algorithms, combinatorics and generating functions. This… 
2009
2009
An eigenvalue of real is called main eigenvalue if it has an eigenvector the sum of whose entries is not equal to zero.In this… 
2003
2003
i=1 s (m) i = √ n ∗. In this work we show that x (m) i = � k � j=1 � n ∗ j s (j) i µ ∗ +2 µm +1 � √ nm and s (m) i = � k � j=1… 
1998
1998
For the $n \times n$ matrix $A = tri\!\diag \,[-1 \;2 -1]$, the associated Gauss--Seidel matrix $C$ is formed. The distinct…