Fusions of the generalized Hamming scheme on a strongly-regular graph
arXiv:2202.01150 · doi:10.1007/s00373?022?02545?4
Abstract
In this paper we show that for any fusion of an association scheme , the generalized Hamming scheme is a nontrivial fusion of . We analyze the case where is the association scheme on a strongly-regular graph, and determine the parameters of all strongly-regular graphs for which the generalized Hamming scheme, , has extra fusions, in addition to the one arising from the trivial fusion of .