Peter J. Cameron

ORCID

Publication Activity (10 Years)

Years Active: 1973-2024
Publications (10 Years): 24

Top Venues

Publications

Sucharita Biswas, Peter J. Cameron, Angsuman Das, Hiranya Kishore Dey
On the difference of the enhanced power graph and the power graph of a finite group. J. Comb. Theory, Ser. A 208 (2024)
Parthajit Bhowal, Peter J. Cameron, Rajat Kanti Nath, Benjamin Sambale
Solvable conjugacy class graph of groups. Discret. Math. 346 (8) (2023)
G. Arunkumar, Peter J. Cameron, T. Kavaskar, T. Tamizh Chelvam
Induced subgraphs of zero-divisor graphs. Discret. Math. 346 (10) (2023)
Peter J. Cameron, Veronica Phan
Enhanced power graphs are weakly perfect. Australas. J Comb. 85 (2023)
Peter J. Cameron, Bojan Kuzma
Between the enhanced power graph and the commuting graph. J. Graph Theory 102 (2) (2023)
David Bradley-Williams, Peter J. Cameron, Jan Hubicka, Matej Konecný
EPPA numbers of graphs. CoRR (2023)
G. Arunkumar, Peter J. Cameron, Rajat Kanti Nath, Lavanya Selvaganesh
Super Graphs on Groups, I. Graphs Comb. 38 (3) (2022)
Peter J. Cameron, R. Raveendra Prathap, T. Tamizh Chelvam
Subgroup Sum Graphs of Finite Abelian Groups. Graphs Comb. 38 (4) (2022)
Rosemary A. Bailey, Peter J. Cameron, Michael Kinyon, Cheryl E. Praeger
Diagonal groups and arcs over groups. Des. Codes Cryptogr. 90 (9) (2022)
Pallabi Manna, Peter J. Cameron, Ranjit Mehatari
Forbidden Subgraphs of Power Graphs. Electron. J. Comb. 28 (3) (2021)
Peter J. Cameron, Saul D. Freedman, Colva M. Roney-Dougal
The Non-Commuting, Non-Generating Graph of a Nilpotent Group. Electron. J. Comb. 28 (1) (2021)
Ajay Kumar, Lavanya Selvaganesh, Peter J. Cameron, T. Tamizh Chelvam
Recent developments on the power graph of finite groups - a survey. AKCE Int. J. Graphs Comb. 18 (2) (2021)
Peter J. Cameron, Sayyed Heidar Jafari
On the Connectivity and Independence Number of Power Graphs of Groups. Graphs Comb. 36 (3) (2020)
Peter J. Cameron, Sean Eberhard
On the paper "Association schemes for diagonal groups". Australas. J Comb. 78 (2020)
Peter J. Cameron, Sean Eberhard
Association schemes for diagonal groups. Australas. J Comb. 75 (2019)
Peter J. Cameron, David Ellis, William Raynaud
Smallest cyclically covering subspaces of Fqn, and lower bounds in Isbell's conjecture. Eur. J. Comb. 81 (2019)
Peter J. Cameron, Jason Semeraro
The Cycle Polynomial of a Permutation Group. Electron. J. Comb. 25 (1) (2018)
Peter J. Cameron, Kerri Morgan
Algebraic Properties of Chromatic Roots. Electron. J. Comb. 24 (1) (2017)
Peter J. Cameron, Josephine Kusuma, Patrick Solé
-codes and their Gray map images as orthogonal arrays. Des. Codes Cryptogr. 84 (1-2) (2017)
Ghodratollah Aalipour, Saieed Akbari, Peter J. Cameron, Reza Nikandish, Farzad Shaveisi
On the Structure of the Power Graph and the Enhanced Power Graph of a Group. Electron. J. Comb. 24 (3) (2017)
Peter J. Cameron, Ntah Ahn Dang, Søren Riis
Guessing Games on Triangle-Free Graphs. Electron. J. Comb. 23 (1) (2016)
Peter J. Cameron, Josephine Kusuma
-codes and their Gray map images as orthogonal arrays. CoRR (2015)
Peter J. Cameron, Pablo Spiga
Most switching classes with primitive automorphism groups contain graphs with trivial groups. Australas. J Comb. 62 (2015)
Sebastian M. Cioaba, Peter J. Cameron
A Graph Partition Problem. Am. Math. Mon. 122 (10) (2015)
Joshua Browning, Peter J. Cameron, Ian M. Wanless
Bounds on the number of small Latin subsquares. J. Comb. Theory, Ser. A 124 (2014)
Peter J. Cameron, Ben Fairbairn, Maximilien Gadouleau
Computing in Permutation Groups Without Memory. Chic. J. Theor. Comput. Sci. 2014 (2014)
Peter J. Cameron, Ben Fairbairn, Maximilien Gadouleau
Computing in Matrix Groups Without Memory. Chic. J. Theor. Comput. Sci. 2014 (2014)
João Araújo, Peter J. Cameron
Primitive groups synchronize non-uniform maps of extreme ranks. J. Comb. Theory, Ser. B 106 (2014)
Peter J. Cameron, Ntah Ahn Dang, Søren Riis
Guessing Games on Triangle-free Graphs. CoRR (2014)
Peter J. Cameron
Dixon's theorem and random synchronization. Discret. Math. 313 (11) (2013)
Peter J. Cameron
Groups with right-invariant multiorders. Australas. J Comb. 56 (2013)
Peter J. Cameron, Maximilien Gadouleau, Søren Riis
Combinatorial representations. J. Comb. Theory, Ser. A 120 (3) (2013)
Peter J. Cameron, Ben Fairbairn, Maximilien Gadouleau
Computing in permutation groups without memory. CoRR (2013)
João Araújo, Wolfram Bentz, Peter J. Cameron
Groups synchronizing a transformation of non-uniform kernel. Theor. Comput. Sci. 498 (2013)
Peter J. Cameron, Ben Fairbairn, Maximilien Gadouleau
Computing in matrix groups without memory. CoRR (2013)
Peter J. Cameron, Bridget S. Webb
Perfect countably infinite Steiner triple systems. Australas. J Comb. 54 (2012)
Peter J. Cameron, Maximilien Gadouleau
Remoteness of permutation codes. Eur. J. Comb. 33 (6) (2012)
Paola Bonizzoni, Peter J. Cameron, Gianluca Della Vedova, Alberto Leporati, Giancarlo Mauri
A Unifying Framework to Characterize the Power of a Language to Express Relations CoRR (2012)
Peter J. Cameron
Research problems from the BCC22. Discret. Math. 311 (13) (2011)
Peter J. Cameron, Shamik Ghosh
The power graph of a finite group. Discret. Math. 311 (13) (2011)
Peter J. Cameron, Christian Krattenthaler, Thomas W. Müller
A note on higher-dimensional magic matrices. Australas. J Comb. 50 (2011)
Peter J. Cameron, Thomas Prellberg, Dudley Stark
Asymptotic enumeration of 2-covers and line graphs. Discret. Math. 310 (2) (2010)
Peter J. Cameron
Research Problems from the BCC21. Discret. Math. 310 (2) (2010)
Peter J. Cameron, Taoyang Wu
The complexity of the weight problem for permutation and matrix groups. Discret. Math. 310 (3) (2010)
Peter J. Cameron, Deborah C. Lockett
Posets, homomorphisms and homogeneity. Discret. Math. 310 (3) (2010)
Peter J. Cameron, Mihyun Kang, Dudley Stark
Random preorders and alignments. Discret. Math. 310 (3) (2010)
Peter J. Cameron
Problems from CGCS Luminy, May 2007. Eur. J. Comb. 31 (2) (2010)
Peter J. Cameron
Permutation codes. Eur. J. Comb. 31 (2) (2010)
Peter J. Cameron
A generalisation of t-designs. Discret. Math. 309 (14) (2009)
Taoyang Wu, Peter J. Cameron, Søren Riis
On the guessing number of shift graphs. J. Discrete Algorithms 7 (2) (2009)
Christoph Buchheim, Peter J. Cameron, Taoyang Wu
On the subgroup distance problem. Discret. Math. 309 (4) (2009)
Peter J. Cameron
Decompositions of complete multipartite graphs. Discret. Math. 309 (12) (2009)
Peter J. Cameron, Bill Jackson, Jason D. Rudd
Orbit-counting polynomials for graphs and codes. Discret. Math. 308 (5-6) (2008)
Peter J. Cameron, Daniel Johannsen, Thomas Prellberg, Pascal Schweitzer
Counting Defective Parking Functions. Electron. J. Comb. 15 (1) (2008)
Peter J. Cameron, Daniele A. Gewurz, Francesca Merola
Product action. Discret. Math. 308 (2-3) (2008)
R. A. Bailey, Peter J. Cameron, Robert Connelly
Sudoku, Gerechte Designs, Resolutions, Affine Space, Spreads, Reguli, and Hamming Codes. Am. Math. Mon. 115 (5) (2008)
Peter J. Cameron, Taoyang Wu
The complexity of the Weight Problem for permutation groups. Electron. Notes Discret. Math. 28 (2007)
Peter J. Cameron, Natalia Iyudu
Graphs of relations and Hilbert series. J. Symb. Comput. 42 (11-12) (2007)
R. A. Bailey, Peter J. Cameron
What is a design? How should we classify them? Des. Codes Cryptogr. 44 (1-3) (2007)
Peter J. Cameron, A. Rudvalis
. Des. Codes Cryptogr. 44 (1-3) (2007)
Peter J. Cameron, Ashley Montanaro, Michael W. Newman, Simone Severini, Andreas J. Winter
On the Quantum Chromatic Number of a Graph. Electron. J. Comb. 14 (1) (2007)
Peter J. Cameron, Koko Kalambay Kayibi
Orbital Chromatic and Flow Roots. Comb. Probab. Comput. 16 (3) (2007)
R. A. Bailey, Peter J. Cameron, Peter Dobcsányi, John P. Morgan, Leonard H. Soicher
Designs on the web. Discret. Math. 306 (23) (2006)
Peter J. Cameron, John Sheehan, Pablo Spiga
Semiregular automorphisms of vertex-transitive cubic graphs. Eur. J. Comb. 27 (6) (2006)
Peter J. Cameron, Jaroslav Nesetril
Homomorphism-Homogeneous Relational Structures. Comb. Probab. Comput. 15 (1-2) (2006)
Peter J. Cameron, Anatoly M. Vershik
Some isometry groups of the Urysohn space. Ann. Pure Appl. Log. 143 (1-3) (2006)
Peter J. Cameron
Research problems from the 2003 IPM Workshop. Discret. Math. 306 (23) (2006)
Peter J. Cameron, Thomas Prellberg, Dudley Stark
Asymptotics for Incidence Matrix Classes. Electron. J. Comb. 13 (1) (2006)
Andries E. Brouwer, Peter J. Cameron, Willem H. Haemers, Donald A. Preece
Self-dual, not self-polar. Discret. Math. 306 (23) (2006)
Christoph Buchheim, Peter J. Cameron, Taoyang Wu
On the Subgroup Distance Problem. Electron. Colloquium Comput. Complex. 13 (146) (2006)
Peter J. Cameron, Hamid Reza Maimani, G. R. Omidi, Behruz Tayfeh-Rezaie
3-Designs from PSL(2, q). Discret. Math. 306 (23) (2006)
Peter J. Cameron, G. R. Omidi, Behruz Tayfeh-Rezaie
3-Designs from PGL(2, q). Electron. J. Comb. 13 (1) (2006)
Peter J. Cameron, Norbert Knarr
Tubes in PG(3, q). Eur. J. Comb. 27 (1) (2006)
Peter J. Cameron, Charles R. Johnson
The number of equivalence classes of symmetric sign patterns. Discret. Math. 306 (23) (2006)
Peter J. Cameron
The random graph has the strong small index property. Discret. Math. 291 (1-3) (2005)
Peter J. Cameron, Ian M. Wanless
Covering radius for sets of permutations. Discret. Math. 293 (1-3) (2005)
Peter J. Cameron
Research problems from the 19th British Combinatorial Conference. Discret. Math. 293 (1-3) (2005)
Peter J. Cameron
Tribute. Discret. Math. 291 (1-3) (2005)
Peter J. Cameron
Partitions and permutations. Discret. Math. 291 (1-3) (2005)
Peter J. Cameron, Sam Tarzi
Switching with more than two colours. Eur. J. Comb. 25 (2) (2004)
Peter J. Cameron
Multi-letter Youden rectangles from quadratic forms. Discret. Math. 266 (1-3) (2003)
Peter J. Cameron
Research problems from the 18th British Combinatorial Conference. Discret. Math. 266 (1-3) (2003)
Peter J. Cameron
Random strongly regular graphs? Discret. Math. 273 (1-3) (2003)
Priscila P. Alejandro, R. A. Bailey, Peter J. Cameron
Association schemes and permutation groups. Discret. Math. 266 (1-3) (2003)
Peter J. Cameron, Cheng Yeaw Ku
Intersecting families of permutations. Eur. J. Comb. 24 (7) (2003)
Anthony Bonato, Peter J. Cameron, Dejan Delic, Stéphan Thomassé
. Eur. J. Comb. 23 (3) (2002)
Peter J. Cameron, Dudley Stark
A Prolific Construction of Strongly Regular Graphs with the n-e.c. Property. Electron. J. Comb. 9 (1) (2002)
Peter J. Cameron
Cycle Index, Weight Enumerator, and Tutte Polynomial. Electron. J. Comb. 9 (1) (2002)
Peter J. Cameron
Homogeneous Permutations. Electron. J. Comb. 9 (2) (2002)
Peter J. Cameron, Wilfrid Hodges
Some Combinatorics of Imperfect Information. J. Symb. Log. 66 (2) (2001)
Peter J. Cameron
Random strongly regular graphs? Electron. Notes Discret. Math. 10 (2001)
László Babai, Peter J. Cameron
Automorphisms and Enumeration of Switching Classes of Tournaments. Electron. J. Comb. 7 (2000)
Jason P. Bell, Edward A. Bender, Peter J. Cameron, L. Bruce Richmond
Asymptotics for the Probability of Connectedness and the Distribution of Number of Components. Electron. J. Comb. 7 (2000)
Peter J. Cameron
Problems on Discrete Metric Spaces. Eur. J. Comb. 21 (6) (2000)
Peter J. Cameron
Some counting problems related to permutation groups. Discret. Math. 225 (1-3) (2000)
Peter J. Cameron
Homogeneous Cayley Objects. Eur. J. Comb. 21 (6) (2000)
Peter J. Cameron
SGDs with doubly transitive automorphism group. J. Graph Theory 32 (3) (1999)
Peter J. Cameron
An extremal problem related to biplanes. Australas. J Comb. 20 (1999)
Neil J. Calkin, Peter J. Cameron
Almost Odd Random Sum-Free Sets. Comb. Probab. Comput. 7 (1) (1998)
Peter J. Cameron
A census of infinite distance-transitive graphs. Discret. Math. 192 (1-3) (1998)

Peter J. Cameron.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Peter J. Cameron