Reduction procedures for calculating the
โ
H.M. Rara
๐
Article
๐
1996
๐
Elsevier Science
๐
English
โ 207 KB
Let G be a graph without loops and multiple edges. If V(G) = {vl, v2 .... , v,}, we define the adjacency matrix of G to be the n x n (0, D-matrix A(G) = (aij), where ais = l if viv s e E(G) and ais = 0 otherwise. G is said to be singular if the matrix A(G) is singular. Reduction procedures which wil