1 citations · 2 across the 4 of their papers we have counts for
6 papers
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…
A Las Vegas Rewriting Algorithm for the Symmetric Square Representation of Classical Groups
Brian Philip Corr
In constructive recognition of a representation of a Classical group , much attention has been paid to the natural representation as well as to generic (Black Box) algorithms th…
Finite 2-distance transitive graphs
Brian P. Corr, Wei Jin, Csaba Schneider
A non-complete graph is said to be -distance transitive if is a subgroup of the automorphism group of that is transitive on the vertex set of , and for any ve…
Nilpotent-independent sets and estimation in matrix algebras
Brian P. Corr, Tomasz Popiel, Cheryl E. Praeger
Efficient methods for computing with matrices over finite fields often involve randomised algorithms, where matrices with a certain property are sought via repeated random selectio…
Normal Edge-Transitive Cayley Graphs of Frobenius Groups
Brian P. Corr, Cheryl E. Praeger
A Cayley Graph for a group is called normal edge-transitive if it admits an edge-transitive action of some subgroup of the Holomorph of (the normaliser of a regular copy of…
Primary Cyclic Matrices in Irreducible Matrix Subalgebras
Brian P. Corr, Cheryl E. Praeger
Primary Cyclic matrices were used (but not named) by Holt and Rees in their version of Parker's MEAT-AXE algorithm to test irreducibility of finite matrix groups and algebras. They…