30 citations · 32 across the 5 of their papers we have counts for
Showing math.COShow all
3 papers · 1 filter
math.CO2016
Generalised Paley graphs with a product structure
Geoffrey Pearce, Cheryl E Praeger
A graph is Cartesian decomposable if it is isomorphic to a Cartesian product of (more than one) strictly smaller graphs, each of which has more than one vertex and admits no such d…
math.CO2010★ 1 cited
Basic and degenerate pregeometries
Michael Giudici, Cai Heng Li, Geoffrey Pearce +1
We study pairs , where is a 'Buekenhout-Tits' pregeometry with all rank 2 truncations connected, and is transitive on the set of elements of e…
math.CO2007
Transitive decompositions of graphs and their links with geometry and origami
Geoffrey Pearce
A transitive decomposition of a graph is a partition of the edge or arc set giving a set of subgraphs which are preserved and permuted transitively by a group of automorphisms of t…