3 papers
math.CO2023
The -Analogue of Zero Forcing for Certain Families of Graphs
Shaun Fallat, Neha Joshi, Roghayeh Maleki +6
Zero forcing is a combinatorial game played on a graph with the ultimate goal of changing the colour of all the vertices at minimal cost. Originally this game was conceived as a on…
math.CO2023
Fusions of the Tensor Square of a Strongly Regular Graph
Allen Herman, Neha Joshi
In this paper we determine all fusions of the association scheme , where is the symmetric rank association scheme corresponding t…
math.CO2022
Fusions of the generalized Hamming scheme on a strongly-regular graph
Allen Herman, Neha Joshi, Karen Meagher
In this paper we show that for any fusion of an association scheme , the generalized Hamming scheme is a nontrivial fusion of $H(n,\ma…