Intersection numbers for coherent configurations and the spectrum of a graph (Q790128)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Intersection numbers for coherent configurations and the spectrum of a graph |
scientific article |
Statements
Intersection numbers for coherent configurations and the spectrum of a graph (English)
0 references
1983
0 references
Let \(X=\sum x_ iA_ i\) and \(Y=\sum y_ jA_ j\) be two generic matrices of the adjacency algebra of a labelled, directed graph. The intersection numbers \(a_{ijk}\) are defined by \(XY=\sum a_{ijk}x_ iy_ jA_ k\). Two theorems are established. 1. The intersection numbers determine the determinant of a generic matrix in the adjacency algebra. 2. The determinant of a generic matrix in the adjacency algebra determines the sums \(a_{ajk}+a_{jik}\) of pairs of intersection numbers.
0 references
generic matrix
0 references
isomorphism class
0 references
adjacency matrix
0 references
intersection number
0 references
labelled graph
0 references
adjacency algebra
0 references