4 citations · 4 across the 5 of their papers we have counts for
7 papers
Four class association scheme double covers of strongly regular graphs
Patrick Cesarz, Jason Williford
In this paper we give necessary conditions for 4-class association schemes that are generated by double covers of strongly regular graphs. These conditions are applied to open case…
A Classification of Hyperfocused 12-Arcs
Philip DeOrsey, Stephen G. Hartke, Jason Williford
A -arc in PG() is a set of points no three of which are collinear. A hyperfocused -arc is a -arc in which the secants meet some external line in exa…
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…
The Eigenvalues of the Graphs
G. Eric Moorhouse, Shuying Sun, Jason Williford
The graphs have connected components giving the best known bounds on extremal problems with {\em forbidden\/} even cycles, and are denser than the well-known gra…
On the Wiener index, distance cospectrality and transmission regular graphs
Aida Abiad, Boris Brimkov, Aysel Erey +5
In this paper, we investigate various algebraic and graph theoretic properties of the distance matrix of a graph. Two graphs are -cospectral if their distance matrices have the…
Double Covers of Symplectic Dual Polar Graphs
G. Eric Moorhouse, Jason Williford
Let be the dual polar graph of type . Underlying this graph is a -dimensional vector space over a field of odd order , together wit…
Extremal Graphs Without 4-Cycles
Frank A. Firke, Peter M. Kosek, Evan D. Nash +1
We prove an upper bound for the number of edges a C4-free graph on q^2 + q vertices can contain for q even. This upper bound is achieved whenever there is an orthogonal polarity gr…