Gordon F. Royle

发表

Symmetric designs, polarities and sub-designs

Tim Penttila, P. H. Fisher, Gordon F. Royle, 1988, Discret. Math..

Chromatic roots at 2 and the Beraha number B10

Gordon F. Royle, Daniel J. Harvey, 2020, J. Graph Theory.

Chromatic Roots of a Ring of Four Cliques

Gordon F. Royle, Feng Ming Dong, Dave Wagner, 2011, Electron. J. Comb..

Efficient Algorithms for Listing Combinatorial Structures

Gordon F. Royle, 1995 .

Constructing the vertex-transitive graphs on 24 vertices

Gordon F. Royle, 1991, SIGS.

Graph Domination, Tabu Search and the Football Pool Problem

Gordon F. Royle, Rowan Davies, G. Royle, 1997, Discret. Appl. Math..

The translation planes of order 49

Gordon F. Royle, Rudolf Mathon, 1995, Des. Codes Cryptogr..

The Transitive Groups of Degree Twelve

Gordon F. Royle, G. Royle, 1987, J. Symb. Comput..

Java as a teaching language—opportunities, pitfalls and solutions

David Clark, Gordon F. Royle, Cara MacNish, 1998, ACSE '98.

Chromatic Number and the 2-Rank of a Graph

Chris D. Godsil, Gordon F. Royle, G. Royle, 2001, J. Comb. Theory B.

Excluding Kuratowski graphs and their duals from binary matroids

Gordon F. Royle, Dillon Mayhew, Geoff Whittle, 2009, J. Comb. Theory, Ser. B.

Regular vertex diameter critical graphs

Gordon F. Royle, G. Royle, 2002, Australas. J Comb..

Vertex-switching reconstruction of subgraph numbers and triangle-free graphs

Gordon F. Royle, Mark N. Ellingham, 1992, J. Comb. Theory, Ser. B.

Graphs whose flow polynomials have only integral roots

Joseph P. S. Kung, Gordon F. Royle, G. Royle, 2009, Eur. J. Comb..

Colouring lines in projective space

Chris D. Godsil, Gordon F. Royle, Ameera Chowdhury, 2006, J. Comb. Theory, Ser. A.

Algebraic Graph Theory

Gordon F. Royle, Christopher D. Godsil, G. Royle, 2001, Graduate texts in mathematics.

The Merino-Welsh conjecture holds for series-parallel graphs

Gordon F. Royle, Steven D. Noble, 2014, Eur. J. Comb..

Primitive permutation groups with a suborbit of length 5 and vertex-primitive graphs of valency 5

Cheryl E. Praeger, Cai Heng Li, Gordon F. Royle, 2016, J. Comb. Theory, Ser. A.

An 11-vertex theorem for 3-connected cubic graphs

Gordon F. Royle, Robert E. L. Aldred, Sheng Bau, 1988, J. Graph Theory.

Constructing the Vertex-Transitive Graphs of Order 24

Cheryl E. Praeger, Gordon F. Royle, G. Royle, 1989, J. Symb. Comput..

A family of resolvable regular graph designs

Donald L. Kreher, Gordon F. Royle, Walter D. Wallis, 1996, Discret. Math..

Second neighbourhoods of strongly regular graphs

Gordon F. Royle, A. Gardiner, Chris Godsil, 1992, Discret. Math..

An orderly algorithm and some applications in finite geometry

Gordon F. Royle, 1998, Discret. Math..

The Internally 4-Connected Binary Matroids with No $M(K_{5}\backslash e)$-Minor

Gordon F. Royle, Dillon Mayhew, G. Royle, 2012, SIAM J. Discret. Math..

Graphs with Chromatic Roots in the Interval (1, 2)

Gordon F. Royle, 2007, Electron. J. Comb..

On regular induced subgraphs of generalized polygons

John Bamberg, Gordon F. Royle, Anurag Bishnoi, 2017, J. Comb. Theory, Ser. A.

Constructing Bridge Club Designs

Gordon F. Royle, Walter D. Wallis, 1994 .

Matroids with nine elements

Gordon F. Royle, Dillon Mayhew, 2008, J. Comb. Theory, Ser. B.

Set-homogeneous directed graphs

Cheryl E. Praeger, Gordon F. Royle, Robert Gray, 2010, J. Comb. Theory, Ser. B.

Symmetric squares of graphs

Chris D. Godsil, Gordon F. Royle, Koenraad Audenaert, 2007, J. Comb. Theory, Ser. B.

Small graphs with chromatic number 5: A computer search

Gordon F. Royle, Tommy R. Jensen, G. Royle, 1995, J. Graph Theory.

Generalised quadrangles with a group of automorphisms acting primitively on points and lines

Joy Morris, John Bamberg, Gordon F. Royle, 2012, J. Comb. Theory, Ser. A.

Maximum Size Binary Matroids with no AG(3, 2)-Minor are Graphic

Joseph P. S. Kung, Gordon F. Royle, Dillon Mayhew, 2013, SIAM J. Discret. Math..

The Brown-Colbourn conjecture on zeros of reliability polynomials is false

Gordon F. Royle, Alan D. Sokal, 2004, J. Comb. Theory, Ser. B.

Edge-Selection Heuristics for Computing Tutte Polynomials

Gordon F. Royle, David J. Pearce, Gary Haggard, 2009, Chic. J. Theor. Comput. Sci..

Hemisystems of small flock generalized quadrangles

John Bamberg, Gordon F. Royle, Michael Giudici, 2010, Designs, Codes and Cryptography.

Inversive Planes of Odd Order

Cheryl E. Praeger, Tim Penttila, P. H. Fisher, 1989, Eur. J. Comb..

Computing Tutte Polynomials

Gordon F. Royle, David J. Pearce, Gary Haggard, 2010, ACM Trans. Math. Softw..

Quartic Graphs with Every Edge in a Triangle

Gordon F. Royle, Florian Pfender, 2016, J. Graph Theory.

The chromatic number and rank of the complements of the Kasami graphs

Aidan Roy, Gordon F. Royle, 2007, Discret. Math..

On the p-rank of incidence matrices and a bound of Bruen and Ott

Chris D. Godsil, Gordon F. Royle, Dominique de Caen, 1992, Des. Codes Cryptogr..

Linear Bound in Terms of Maxmaxflow for the Chromatic Roots of Series-Parallel Graphs

Gordon F. Royle, Alan D. Sokal, A. Sokal, 2013, SIAM J. Discret. Math..

The Rank of a Cograph

Gordon F. Royle, 2003, Electron. J. Comb..

Spreads of T2(o), α-flocks and Ovals

Tim Penttila, Gordon F. Royle, Matthew R. Brown, 2004, Des. Codes Cryptogr..

The Rank Polynomial

Chris Godsil, Gordon F. Royle, G. Royle, 2001 .

Hajós constructions of critical graphs

Gordon F. Royle, Tommy R. Jensen, 1999, J. Graph Theory.

BLT-sets over small fields

Tim Penttila, Gordon F. Royle, 1998, Australas. J Comb..

Sets of type (m, n) in the affine and projective planes of order nine

Tim Penttila, Gordon F. Royle, G. Royle, 1995, Des. Codes Cryptogr..

The 2-rotational Steiner triple systems of order 25

Yeow Meng Chee, Gordon F. Royle, 1991, Discret. Math..

Orbits of Sylow subgroups of finite permutation groups

Cheryl E. Praeger, Alice Devillers, John Bamberg, 2021, 2102.00448.

Synchronising primitive groups of diagonal type exist

John Bamberg, Gordon F. Royle, Michael Giudici, 2021 .

Flocks and ovals

Tim Penttila, Gordon F. Royle, William Cherowitzo, 1996 .

The Transitive Graphs with at Most 26 Vertices

Brendan D. McKay, Gordon F. Royle, B. McKay, 1990 .

Optimal semi-Latin squares with side six and block size two

Gordon F. Royle, R. A. Bailey, G. Royle, 1997, Proceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences.

Cuts and Flows

Chris Godsil, Gordon F. Royle, 2001 .

STRONGLY REGULAR GRAPHS

Chris Godsil, Gordon F. Royle, G. Royle, 2001 .

A Characterization of Well-covered Cubic Graphs

Gordon F. Royle, Mark N. Ellingham, S. Campbell, 1993 .

Constructive enumeration of graphs

Gordon F. Royle, 1988, Bulletin of the Australian Mathematical Society.

Classification of hyperovals inPG(2,32)

Tim Penttila, Gordon F. Royle, G. Royle, 1994 .

Sets of type (m,n) in affine and projective planes of order 9

Tim Penttila, Gordon F. Royle, G. Royle, 1994 .

A NORMAL NON-CAYLEY-INVARIANT GRAPH FOR THE ELEMENTARY ABELIAN GROUP OF ORDER 64

Gordon F. Royle, G. Royle, 2008, Journal of the Australian Mathematical Society.

On hyperovals in small projective planes

Tim Penttila, Gordon F. Royle, 1995 .

Hyperovals in the Known Projective Planes of Order 16

Tim Penttila, Gordon F. Royle, G. Royle, 1996 .

Supports of (ν,4,2) designs

Charles J. Colbourn, Gordon F. Royle, 1991 .

The Laplacian of a Graph

Chris Godsil, Gordon F. Royle, G. Royle, 2001 .