Cheryl E. Praeger

According to our database1, Cheryl E. Praeger
  • authored at least 110 papers between 1978 and 2017.
  • has a "Dijkstra number"2 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2017
On the complexity of multiplication in the Iwahori-Hecke algebra of the symmetric group.
J. Symb. Comput., 2017

Point-primitive generalised hexagons and octagons.
J. Comb. Theory, Ser. A, 2017

On the dimension of twisted centralizer codes.
Finite Fields and Their Applications, 2017

2016
Two-sided Group Digraphs and Graphs.
Journal of Graph Theory, 2016

Entry-faithful 2-neighbour transitive codes.
Des. Codes Cryptography, 2016

On the dimension of twisted centralizer codes.
CoRR, 2016

Twisted Centralizer Codes.
CoRR, 2016

Finite Edge-Transitive Oriented Graphs of Valency Four: a Global Approach.
Electr. J. Comb., 2016

2015
Finite 2-Geodesic Transitive Graphs of Prime Valency.
Journal of Graph Theory, 2015

Pairwise transitive 2-designs.
J. Comb. Theory, Ser. A, 2015

Locally triangular graphs and rectagraphs with symmetry.
J. Comb. Theory, Ser. A, 2015

On geodesic transitive graphs.
Discrete Mathematics, 2015

2014
Elements in finite classical groups whose powers have large 1-Eigenspaces.
Discrete Mathematics & Theoretical Computer Science, 2014

Sporadic neighbour-transitive codes in Johnson graphs.
Des. Codes Cryptography, 2014

Neighbour-transitive codes in Johnson graphs.
Des. Codes Cryptography, 2014

2013
Proportions of r-regular elements in finite classical groups.
J. London Math. Society, 2013

Uniqueness of certain completely regular Hadamard codes.
J. Comb. Theory, Ser. A, 2013

Local 2-geodesic transitivity and clique graphs.
J. Comb. Theory, Ser. A, 2013

Locally s-distance transitive graphs and pairwise transitive designs.
J. Comb. Theory, Ser. A, 2013

Rank 3 Transitive Decompositions of Complete Multipartite Graphs.
Graphs and Combinatorics, 2013

Neighbour transitivity on codes in Hamming graphs.
Des. Codes Cryptography, 2013

Symmetric diameter two graphs with affine-type vertex-quasiprimitive automorphism group.
Des. Codes Cryptography, 2013

Straight-line programs with memory and matrix Bruhat decomposition
CoRR, 2013

2012
On semiregular permutations of a finite set.
Math. Comput., 2012

A new solvability criterion for finite groups.
J. London Math. Society, 2012

On imprimitive rank 3 permutation groups.
J. London Math. Society, 2012

Locally s-distance transitive graphs.
Journal of Graph Theory, 2012

Bounding the size of a vertex-stabiliser in a finite vertex-transitive graph.
J. Comb. Theory, Ser. B, 2012

Set-homogeneous directed graphs.
J. Comb. Theory, Ser. B, 2012

Basic and degenerate pregeometries.
Eur. J. Comb., 2012

Quotient-complete arc-transitive graphs.
Eur. J. Comb., 2012

Symmetry properties of subdivision graphs.
Discrete Mathematics, 2012

Quotients of incidence geometries.
Des. Codes Cryptography, 2012

Elusive Codes in Hamming Graphs
CoRR, 2012

Classification of a family of completely transitive codes
CoRR, 2012

Finding permutations containing long cycles in finite alternating and symmetric groups acting on subsets
CoRR, 2012

2011
On imprimitive rank 3 permutation groups.
J. London Math. Society, 2011

Normal coverings of finite symmetric and alternating groups.
J. Comb. Theory, Ser. A, 2011

Invariant Relations and Aschbacher Classes of Finite Linear Groups.
Electr. J. Comb., 2011

2010
Bipartite Divisor Graphs for Integer Subsets.
Graphs and Combinatorics, 2010

Imprimitive symmetric graphs with cyclic blocks.
Eur. J. Comb., 2010

Some graphs related to the small Mathieu groups.
Eur. J. Comb., 2010

Constructive Membership Testing in Black-Box Classical Groups.
Proceedings of the Mathematical Software, 2010

2009
Flag-transitive symmetric 2-(96, 20, 4)-designs.
J. Comb. Theory, Ser. A, 2009

Common circulant homogeneous factorisations of the complete digraph.
Discrete Mathematics, 2009

2008
Primitive decompositions of Johnson graphs.
J. Comb. Theory, Ser. A, 2008

Homogeneous factorisations of graph products.
Discrete Mathematics, 2008

On the domination number of the generalized Petersen graphs.
Discrete Mathematics, 2008

Classification of line-transitive point-imprimitive linear spaces with line size at most 12.
Des. Codes Cryptography, 2008

Homogeneous factorisations of Johnson graphs.
Des. Codes Cryptography, 2008

2007
On limit graphs of finite vertex-primitive graphs.
J. Comb. Theory, Ser. A, 2007

A new family of locally 5-arc transitive graphs.
Eur. J. Comb., 2007

Homogeneous factorisations of complete multipartite graphs.
Discrete Mathematics, 2007

The flag-transitive symmetric designs with 45 points, blocks of size 12, and 3 blocks on every point pair.
Des. Codes Cryptography, 2007

Computing Minimal Polynomials of Matrices
CoRR, 2007

2006
Imprimitive flag-transitive symmetric designs.
J. Comb. Theory, Ser. A, 2006

Homogeneous factorisations of graphs and digraphs.
Eur. J. Comb., 2006

2005
Finite symmetric graphs with two-arc transitive quotients.
J. Comb. Theory, Ser. B, 2005

2003
Two-arc closed subsets of graphs.
Journal of Graph Theory, 2003

Inequalities involving the Delandtsheer-Doyen parameters for finite line-transitive linear spaces.
J. Comb. Theory, Ser. A, 2003

On transitive Cayley graphs of groups and semigroups.
Eur. J. Comb., 2003

Quasiprimitivity: Structure and Combinatorial Applications.
Discrete Mathematics, 2003

2002
Constructing Homogeneous Factorisations of Complete Graphs and Digraphs.
Graphs and Combinatorics, 2002

Finding Optimal Routings in Hamming Graphs.
Eur. J. Comb., 2002

Finite locally-quasiprimitive graphs.
Discrete Mathematics, 2002

Permutations With Restricted Cycle Structure And An Algorithmic Application.
Combinatorics, Probability & Computing, 2002

2001
On Non-Cayley Vertex-Transitive Graphs of Order a Product of Three Primes.
J. Comb. Theory, Ser. B, 2001

1999
Tetravalent Graphs Admitting Half-Transitive Group Actions: Alternating Cycles.
J. Comb. Theory, Ser. B, 1999

On the Isomorphism Problem for Finite Cayley Graphs of Bounded Valency.
Eur. J. Comb., 1999

Completely Transitive Codes in Hamming Graphs.
Eur. J. Comb., 1999

1998
On finite groups with the cayley isomorphism property.
Journal of Graph Theory, 1998

Isomorphisms of Finite Cayley Digraphs of Bounded Valency.
J. Comb. Theory, Ser. B, 1998

Antipodal Distance Transitive Covers of Complete Graphs.
Eur. J. Comb., 1998

On orbital regular graphs and frobenius graphs.
Discrete Mathematics, 1998

1997
Partition graphs for finite symmetric groups.
Journal of Graph Theory, 1997

Antipodal Distance-transitive Covers of Complete Bipartite Graphs.
Eur. J. Comb., 1997

1996
Vertex-transitive graphs that are not Cayley graphs. II.
Journal of Graph Theory, 1996

Remarks on Path-transitivity in Finite Graphs.
Eur. J. Comb., 1996

Non-symmetric nearly triply regular designs.
Discrete Mathematics, 1996

On the Characterization of AG(n, q) by its Parameters as a Nearly Triply Regular Design.
Des. Codes Cryptography, 1996

Classified of 2-quasi-invariant subsets.
Ars Comb., 1996

1995
Implementing a recognition algorithm for classical groups.
Proceedings of the Groups and Computation, 1995

1994
Problem Session at ALCOM-91.
Eur. J. Comb., 1994

A Characterization of Certain Families of 4-Valent Symmetric Graphs.
Eur. J. Comb., 1994

On 4-Valent Symmetric Graphs.
Eur. J. Comb., 1994

1993
Vertex-Primitive Graphs of Order a Product of Two Distinct Primes.
J. Comb. Theory, Ser. B, 1993

Symmetric Graphs of Order a Product of Two Distinct Primes.
J. Comb. Theory, Ser. B, 1993

On Finite Affine 2-Arc Transitive Graphs.
Eur. J. Comb., 1993

Block-transitive, point-imprimitive designs with lambda = 1.
Discrete Mathematics, 1993

Block-transitive t-designs I: point-imprimitive designs.
Discrete Mathematics, 1993

Infinite highly arc transitive digraphs and universal covering digraphs.
Combinatorica, 1993

Half-regular symmetric designs.
Australasian J. Combinatorics, 1993

On a reduction theorem for finite, bipartite 2-arc-transitive graphs.
Australasian J. Combinatorics, 1993

1992
Affine distance-transitive groups with alternating or symmetric point stabiliser.
Eur. J. Comb., 1992

Concerning Multiplier Automorphisms of Cyclic Steiner Triple Systems.
Des. Codes Cryptography, 1992

The Block-Transitive, Point-Imprimitive 2-(729, 8, 1) Designs.
Appl. Algebra Eng. Commun. Comput., 1992

1991
Computing with Group Homomorphisms.
J. Symb. Comput., 1991

Balanced directed cycle designs based on groups.
Discrete Mathematics, 1991

On minimal symmetric automorphism groups of finite symmetric graphs.
Australasian J. Combinatorics, 1991

On homomorphic images of edge transitive directed graphs.
Australasian J. Combinatorics, 1991

Computation with Matrix Groups over Finite Fields.
Proceedings of the Groups And Computation, 1991

1990
Block-transitive designs and maximal subgroups of finite symmetric groups.
Australasian J. Combinatorics, 1990

1989
Constructing the Vertex-Transitive Graphs of Order 24.
J. Symb. Comput., 1989

A Characterization of a Class of Symmetric Graphs of Twice Prime Valency.
Eur. J. Comb., 1989

Highly Arc Transitive Digraphs.
Eur. J. Comb., 1989

Inversive Planes of Odd Order.
Eur. J. Comb., 1989

1987
Optimal Worst Case Trees.
Acta Inf., 1987

1983
On 2-arc transitive graphs of girth 4.
J. Comb. Theory, Ser. B, 1983

1980
Note on primitive permutation groups and a diophantine equation.
Discrete Mathematics, 1980

1978
Doubly Transitive Automorphism Groups of Block Designs.
J. Comb. Theory, Ser. A, 1978


  Loading...