Brian G. Kodalen

5 citations · 5 across the 1 of their papers we have counts for

collaborators

3 papers

math.CO2019★ 5 cited

Cometric Association Schemes

Brian G. Kodalen

One may think of a $d$ -class association scheme as a $(d + 1)$ -dimensional matrix algebra over $R$ closed under Schur products. In this context, an imprimitive scheme is one…

math.CO2017

Linked systems of symmetric designs

Brian Kodalen

A linked system of symmetric designs (LSSD) is a $w$ -partite graph ( $w \geq 2$ ) where the incidence between any two parts corresponds to a symmetric design and the designs arising f…

math.CO2017

On the connectivity of graphs in association schemes

Brian G. Kodalen, William J. Martin

Let $(X, R)$ be a commutative association scheme and let $Γ = (X, R \cup R^{⊤})$ be a connected undirected graph where $R \in R$ . Godsil (resp., Brouwer) conjectured…