activity
20082026
most citedResolving sets for Johnson and Kneser graphs

49 citations · 76 across the 19 of their papers we have counts for

collaborators

23 papers

math.CO2026

Vertex-transitive strongly regular graphs in the switching class of doubly transitive two-graphs

Robert F. Bailey, Gábor P. Nagy, Valentino Smaldore

Let be a permutation group that acts -transitively on the finite set and let be a two-graph whose automorphism group contains . In this paper, we…

math.CO2026

Localization and metric dimension for families of highly structured digraphs

Robert F. Bailey, Brittany Pittman

We investigate metric dimension and the localization game for several families of directed analogues of strongly regular graphs and their generalizations, adapting a probabilistic…

math.CO2026

A sporadic strongly regular graph with parameters from a primitive action of the symmetric group on elements

Sam Adriaensen, Robert F. Bailey, Jan De Beule +1

There are up to isomorphism exactly three strongly regular graphs with parameters whose automorphism group acts primitively on the vertices. Two of these graphs be…

math.CO2023

Induced paths in strongly regular graphs

Robert F. Bailey, Abigail K. Rowsell

This paper studies induced paths in strongly regular graphs. We give an elementary proof that a strongly regular graph contains a path as an induced subgraph if and only if i…

math.CO2023

Decoding twisted permutation codes

Robert F. Bailey, Keenan B. Nicholson

We consider twisted permutation codes, a class of frequency permutation arrays obtained from finite groups with multiple permutation representations of the same degree, introduced…

math.CO2022

Block colourings of star systems

Robert F. Bailey, Iren Darijani

An -star system of order is a decomposition of the complete graph into copies of the complete bipartite graph (or -star). Such systems are known to exist…