14 citations · 17 across the 4 of their papers we have counts for
6 papers
Cubic vertex-transitive graphs of girth six
Primož Potočnik, Janoš Vidali
In this paper, a complete classification of finite simple cubic vertex-transitive graphs of girth is obtained. It is proved that every such graph, with the exception of the Des…
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…
DiscreteZOO: a Fingerprint Database of Discrete Objects
Katja Berčič, Janoš Vidali
In this paper, we present DiscreteZOO, a project which illustrates some of the possibilities for computer-supported management of collections of finite combinatorial (discrete) obj…
On tight -designs in Hamming association schemes
Alexander Gavrilyuk, Sho Suda, Janoš Vidali
We complete the classification of tight -designs in Hamming association schemes , i.e., that of tight orthogonal arrays of strength , which had been open since a resu…
Using symbolic computation to prove nonexistence of distance-regular graphs
Janoš Vidali
A package for the Sage computer algebra system is developed for checking feasibility of a given intersection array for a distance-regular graph. We use this tool to show that there…
Girth-regular graphs
Primož Potočnik, Janoš Vidali
We introduce a notion of a girth-regular graph as a -regular graph for which there exists a non-descending sequence (called the signature) giving, for e…