Strongly regular fusions of tensor products of strongly regular graphs (Q1335196)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Strongly regular fusions of tensor products of strongly regular graphs
scientific article

    Statements

    Strongly regular fusions of tensor products of strongly regular graphs (English)
    0 references
    0 references
    28 September 1994
    0 references
    Let \(G\) and \(H\) be strongly regular graphs with (0, 1)-adjacency matrices \(A_ 0= I\), \(A_ 1\), \(A_ 2= J-I- A_ 1\) and \(B_ 0= I\), \(B_ 1,\) \(B_ 2= J- I- B_ 1\) respectively. The tensor product \(G\otimes H\) is defined to be the nine class association scheme with adjacency matrices \(A_ i\otimes B_ j\). By combining (fusing) some of these nine classes, it is sometimes possible to obtain a third strongly regular graph \(F\). The main result of this paper is a complete classification of all parameter sets for strongly regular graphs \(G\), \(H\) and \(F\) for which such a fusion is possible.
    0 references
    strongly regular graphs
    0 references
    tensor product
    0 references
    association scheme
    0 references
    adjacency matrices
    0 references
    fusion
    0 references

    Identifiers