According to our database
1,
Peter J. Cameron
authored at least 139 papers
between 1973 and 2023.
Collaborative distances:
-
Dijkstra number2 of
four.
-
Erdős number3 of
two.
2023
Solvable conjugacy class graph of groups.
Discret. Math., August, 2023
Between the enhanced power graph and the commuting graph.
J. Graph Theory, 2023
Induced subgraphs of zero-divisor graphs.
Discret. Math., 2023
Enhanced power graphs are weakly perfect.
Australas. J Comb., 2023
2022
Subgroup Sum Graphs of Finite Abelian Groups.
Graphs Comb., 2022
Super Graphs on Groups, I.
Graphs Comb., 2022
Diagonal groups and arcs over groups.
Des. Codes Cryptogr., 2022
Recognizing the Commuting Graph of a Finite Group.
CoRR, 2022
2021
Forbidden Subgraphs of Power Graphs.
Electron. J. Comb., 2021
The Non-Commuting, Non-Generating Graph of a Nilpotent Group.
Electron. J. Comb., 2021
Recent developments on the power graph of finite groups - a survey.
AKCE Int. J. Graphs Comb., 2021
2020
On the Connectivity and Independence Number of Power Graphs of Groups.
Graphs Comb., 2020
On the paper "Association schemes for diagonal groups".
Australas. J Comb., 2020
2019
Smallest cyclically covering subspaces of Fqn, and lower bounds in Isbell's conjecture.
Eur. J. Comb., 2019
Association schemes for diagonal groups.
Australas. J Comb., 2019
2018
The Cycle Polynomial of a Permutation Group.
Electron. J. Comb., 2018
2017
ℤ<sub>4</sub>-codes and their Gray map images as orthogonal arrays.
Des. Codes Cryptogr., 2017
Algebraic Properties of Chromatic Roots.
Electron. J. Comb., 2017
On the Structure of the Power Graph and the Enhanced Power Graph of a Group.
Electron. J. Comb., 2017
2016
Guessing Games on Triangle-Free Graphs.
Electron. J. Comb., 2016
2015
A Graph Partition Problem.
Am. Math. Mon., 2015
Z<sub>4</sub>-codes and their Gray map images as orthogonal arrays.
CoRR, 2015
Most switching classes with primitive automorphism groups contain graphs with trivial groups.
Australas. J Comb., 2015
2014
Bounds on the number of small Latin subsquares.
J. Comb. Theory, Ser. A, 2014
Primitive groups synchronize non-uniform maps of extreme ranks.
J. Comb. Theory, Ser. B, 2014
Computing in Matrix Groups Without Memory.
Chic. J. Theor. Comput. Sci., 2014
Computing in Permutation Groups Without Memory.
Chic. J. Theor. Comput. Sci., 2014
2013
Groups synchronizing a transformation of non-uniform kernel.
Theor. Comput. Sci., 2013
Combinatorial representations.
J. Comb. Theory, Ser. A, 2013
Dixon's theorem and random synchronization.
Discret. Math., 2013
Groups with right-invariant multiorders.
Australas. J Comb., 2013
Proceedings of the Mathematics of Paul Erdős II, 2013
2012
Remoteness of permutation codes.
Eur. J. Comb., 2012
A Unifying Framework to Characterize the Power of a Language to Express Relations
CoRR, 2012
Perfect countably infinite Steiner triple systems.
Australas. J Comb., 2012
2011
The power graph of a finite group.
Discret. Math., 2011
Research problems from the BCC22.
Discret. Math., 2011
A note on higher-dimensional magic matrices.
Australas. J Comb., 2011
2010
Problems from CGCS Luminy, May 2007.
Eur. J. Comb., 2010
The complexity of the weight problem for permutation and matrix groups.
Discret. Math., 2010
Asymptotic enumeration of 2-covers and line graphs.
Discret. Math., 2010
Posets, homomorphisms and homogeneity.
Discret. Math., 2010
Random preorders and alignments.
Discret. Math., 2010
Research Problems from the BCC21.
Discret. Math., 2010
2009
On the guessing number of shift graphs.
J. Discrete Algorithms, 2009
A generalisation of t-designs.
Discret. Math., 2009
Decompositions of complete multipartite graphs.
Discret. Math., 2009
2008
Sudoku, Gerechte Designs, Resolutions, Affine Space, Spreads, Reguli, and Hamming Codes.
Am. Math. Mon., 2008
Orbit-counting polynomials for graphs and codes.
Discret. Math., 2008
Counting Defective Parking Functions.
Electron. J. Comb., 2008
2007
Graphs of relations and Hilbert series.
J. Symb. Comput., 2007
The complexity of the Weight Problem for permutation groups.
Electron. Notes Discret. Math., 2007
A design and a geometry for the group <i>Fi</i> <sub>22</sub>.
Des. Codes Cryptogr., 2007
What is a design? How should we classify them?
Des. Codes Cryptogr., 2007
Orbital Chromatic and Flow Roots.
Comb. Probab. Comput., 2007
On the Quantum Chromatic Number of a Graph.
Electron. J. Comb., 2007
2006
Semiregular automorphisms of vertex-transitive cubic graphs.
Eur. J. Comb., 2006
On the Subgroup Distance Problem.
Electron. Colloquium Comput. Complex., 2006
3-Designs from PSL(2, q).
Discret. Math., 2006
The number of equivalence classes of symmetric sign patterns.
Discret. Math., 2006
Research problems from the 2003 IPM Workshop.
Discret. Math., 2006
Self-dual, not self-polar.
Discret. Math., 2006
Homomorphism-Homogeneous Relational Structures.
Comb. Probab. Comput., 2006
Asymptotics for Incidence Matrix Classes.
Electron. J. Comb., 2006
3-Designs from PGL(2, q).
Electron. J. Comb., 2006
Some isometry groups of the Urysohn space.
Ann. Pure Appl. Log., 2006
2005
Covering radius for sets of permutations.
Discret. Math., 2005
Research problems from the 19th British Combinatorial Conference.
Discret. Math., 2005
Partitions and permutations.
Discret. Math., 2005
The random graph has the strong small index property.
Discret. Math., 2005
2004
Switching with more than two colours.
Eur. J. Comb., 2004
2003
Intersecting families of permutations.
Eur. J. Comb., 2003
Research problems from the 18th British Combinatorial Conference.
Discret. Math., 2003
Multi-letter Youden rectangles from quadratic forms.
Discret. Math., 2003
Association schemes and permutation groups.
Discret. Math., 2003
2002
Generalized Pigeonhole Properties of Graphs and Oriented Graphs<sup>*1</sup>.
Eur. J. Comb., 2002
A Prolific Construction of Strongly Regular Graphs with the n-e.c. Property.
Electron. J. Comb., 2002
Homogeneous Permutations.
Electron. J. Comb., 2002
Cycle Index, Weight Enumerator, and Tutte Polynomial.
Electron. J. Comb., 2002
2001
Some Combinatorics of Imperfect Information.
J. Symb. Log., 2001
Random strongly regular graphs?
Electron. Notes Discret. Math., 2001
2000
Problems on Discrete Metric Spaces.
Eur. J. Comb., 2000
Homogeneous Cayley Objects.
Eur. J. Comb., 2000
Some counting problems related to permutation groups.
Discret. Math., 2000
Asymptotics for the Probability of Connectedness and the Distribution of Number of Components.
Electron. J. Comb., 2000
Automorphisms and Enumeration of Switching Classes of Tournaments.
Electron. J. Comb., 2000
1999
SGDs with doubly transitive automorphism group.
J. Graph Theory, 1999
An extremal problem related to biplanes.
Australas. J Comb., 1999
1998
A census of infinite distance-transitive graphs.
Discret. Math., 1998
Almost Odd Random Sum-Free Sets.
Comb. Probab. Comput., 1998
1997
On the probability of connectedness.
Discret. Math., 1997
1996
Metric and Topological Aspects of the Symmetric Group of Countable Degree.
Eur. J. Comb., 1996
Stories about Groups and Sequences.
Des. Codes Cryptogr., 1996
1995
Orbits of antichains revisited.
Eur. J. Comb., 1995
Bases for permutation groups and matroids.
Eur. J. Comb., 1995
Counting Two-graphs Related to Trees.
Electron. J. Comb., 1995
1994
An orbit theorem for Steiner triple systems.
Discret. Math., 1994
1993
Block-transitive t-designs I: point-imprimitive designs.
Discret. Math., 1993
A Theorem on Reconstruction of Random Graphs.
Comb. Probab. Comput., 1993
Random Permutations: Some Group-Theoretic Aspects.
Comb. Probab. Comput., 1993
Infinite highly arc transitive digraphs and universal covering digraphs.
Comb., 1993
1992
Infinite geometric groups of rank 4.
Eur. J. Comb., 1992
On the number of fixed point free elements in a permutation group.
Discret. Math., 1992
Almost all quasigroups have rank 2.
Discret. Math., 1992
1991
Fast Recognition of Doubly Transitive Groups.
J. Symb. Comput., 1991
Covers of graphs and EGQs.
Discret. Math., 1991
The age of a relational structure.
Discret. Math., 1991
Several 2-(46, 6, 3) designs.
Discret. Math., 1991
1990
Small Extended Generalized Quadrangles.
Eur. J. Comb., 1990
1989
Intersecting Families of Finite Sets and Fixed-point-Free 2-Elements.
Eur. J. Comb., 1989
Some sequences of integers.
Discret. Math., 1989
1988
Intersection theorems in permutation groups.
Comb., 1988
1987
Digraphs Admitting Sharply Edge-transitive Automorphism Groups.
Eur. J. Comb., 1987
Some Permutation Representations of a Free Group.
Eur. J. Comb., 1987
1986
Signatures and signed switching classes.
J. Comb. Theory, Ser. B, 1986
Regular orbits of permutation groups on the power set.
Discret. Math., 1986
1985
Rank three permutation groups with rank three subconstituents.
J. Comb. Theory, Ser. B, 1985
Cyclic automorphisms of a countable graph and random sum-free sets.
Graphs Comb., 1985
1983
On 2-arc transitive graphs of girth 4.
J. Comb. Theory, Ser. B, 1983
1982
On the Partial Geometry pg(6, 6, 2).
J. Comb. Theory, Ser. A, 1982
There are only finitely many finite distance-transitive graphs of given valency greater than two.
Comb., 1982
1981
Nonexistence of certain distance-transitive digraphs.
J. Comb. Theory, Ser. B, 1981
Normal subgroups of infinite multiply transitive permutation groups.
Comb., 1981
1980
A note on generalized line graphs.
J. Graph Theory, 1980
J. Comb. Theory, Ser. B, 1980
On Graphs with Given Automorphism Group.
Eur. J. Comb., 1980
1978
Rank 3 Groups and Biplanes.
J. Comb. Theory, Ser. A, 1978
1977
Automorphisms and cohomology of switching classes.
J. Comb. Theory, Ser. B, 1977
1976
Embedding Edge-Colored Complete Graphs in Binary Affine Spaces.
J. Comb. Theory, Ser. A, 1976
1973
Extending Symmetric Designs.
J. Comb. Theory, Ser. A, 1973
