2 citations · 2 across the 4 of their papers we have counts for
Showing 2019Show all
2 papers · 1 filter
math.CO2019★ 2 cited
On the multiplicities of digraph eigenvalues
Alexander L. Gavrilyuk, Sho Suda
We show various upper bounds for the order of a digraph (or a mixed graph) whose Hermitian adjacency matrix has an eigenspace of prescribed codimension. In particular, this general…
math.CO2019
On few-class -polynomial association schemes: feasible parameters and nonexistence results
Alexander L. Gavrilyuk, Janoš Vidali, Jason S. Williford
We present the tables of feasible parameters of primitive -class -polynomial association schemes and - and -class -bipartite association schemes (on up to , $1…