activity
20102025
most citedPrimitive permutation groups with a suborbit of length 5 and vertex-primitive graphs of valency 5

16 citations · 77 across the 45 of their papers we have counts for

collaborators
Showing 2013Show all

6 papers · 1 filter

math.CO2013★ 7 cited

On the order of vertex-stabilisers in vertex-transitive graphs with local group or

Pablo Spiga, Gabriel Verret

Let be a prime and let be either the intransitive permutation group of degree or the transitive permutation group of degree . Let …

math.CO2013

A census of 4-valent half-arc-transitive graphs and arc-transitive digraphs of valence two

Primoz Potocnik, Pablo Spiga, Gabriel Verret

A complete list of all connected arc-transitive asymmetric digraphs of in-valence and out-valence 2 on up to 1000 vertices is presented. As a byproduct, a complete list of all conn…

math.CO2013★ 1 cited

Automorphisms of Cayley graphs on generalised dicyclic groups

Joy Morris, Pablo Spiga, Gabriel Verret

A graph is called a GRR if its automorphism group acts regularly on its vertex-set. Such a graph is necessarily a Cayley graph. Godsil has shown that there are only two infinite fa…

math.CO2013

Semiregular automorphisms of edge-transitive graphs

Michael Giudici, Primoz Potocnik, Gabriel Verret

The polycirculant conjecture asserts that every vertex-transitive digraph has a semiregular automorphism, that is, a nontrivial automorphism whose cycles all have the same length.…

math.CO2013★ 4 cited

Cayley graphs on abelian groups

Edward Dobson, Pablo Spiga, Gabriel Verret

Let be an abelian group and let be the automorphism of defined by . A Cayley graph is said to have an automorphism group \emph{…

math.CO2013★ 1 cited

Arc-transitive graphs of valency 8 have a semiregular automorphism

Gabriel Verret

One version of the polycirculant conjecture states that every vertex-transitive graph has a semiregular automorphism. We give a proof of the conjecture in the arc-transitive case f…