1 citations · 1 across the 7 of their papers we have counts for
4 papers · 1 filter
Nonabelian partial difference sets constructed using abelian techniques
James Davis, John Polhill, Ken Smith +1
A -partial difference set (PDS) is a subset of a group such that , , and every nonidentity element of can be written in either or…
Genuinely nonabelian partial difference sets
John Polhill, James Davis, Ken Smith +1
Strongly regular graphs (SRGs) provide a fertile area of exploration in algebraic combinatorics, integrating techniques in graph theory, linear algebra, group theory, finite fields…
The circular altitude of a graph
John Bamberg, Brian Corr, Alice Devillers +3
In this paper we investigate a parameter of graphs, called the circular altitude, introduced by Peter Cameron. We show that the circular altitude provides a lower bound on the circ…
On -arc-transitive graphs of order
Luke Morgan, Eric Swartz, Gabriel Verret
We show that there exist functions and such that, if , and are positive integers with and is a -valent -arc-transitive graph of order …