The SCEAS System
| |||||||

## Search the dblp DataBase
Gordon F. Royle:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Gordon F. Royle
**The Rank of a Cograph.**[Citation Graph (0, 0)][DBLP] Electr. J. Comb., 2003, v:10, n:, pp:- [Journal] - Rowan Davies, Gordon F. Royle
**Graph Domination, Tabu Search and the Football Pool Problem.**[Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 1997, v:74, n:3, pp:217-228 [Journal] - Matthew R. Brown, Christine M. O'Keefe, Stanley E. Payne, Tim Penttila, Gordon F. Royle
**Spreads of T**[Citation Graph (0, 0)][DBLP]_{2}(o), alpha-flocks and Ovals. Des. Codes Cryptography, 2004, v:31, n:3, pp:251-282 [Journal] - D. de Caen, Chris D. Godsil, Gordon F. Royle
**On the p-Rank of Incidence Matrices and a Bound of Bruen and Ott.**[Citation Graph (0, 0)][DBLP] Des. Codes Cryptography, 1992, v:2, n:4, pp:391-394 [Journal] - Rudolf Mathon, Gordon F. Royle
**The Translation Planes of Order 49.**[Citation Graph (0, 0)][DBLP] Des. Codes Cryptography, 1995, v:5, n:1, pp:57-72 [Journal] - Tim Penttila, Gordon F. Royle
**Sets of Type (m, n) in the Affine and Projective Planes of Order Nine.**[Citation Graph (0, 0)][DBLP] Des. Codes Cryptography, 1995, v:6, n:3, pp:229-245 [Journal] - Aidan Roy, Gordon F. Royle
**The chromatic number and rank of the complements of the Kasami graphs.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2007, v:307, n:1, pp:132-136 [Journal] - Ameera Chowdhury, Chris D. Godsil, Gordon F. Royle
**Colouring lines in projective space.**[Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. A, 2006, v:113, n:1, pp:39-52 [Journal] - Mark N. Ellingham, Gordon F. Royle
**Vertex-switching reconstruction of subgraph numbers and triangle-free graphs.**[Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. B, 1992, v:54, n:2, pp:167-177 [Journal] - Chris D. Godsil, Gordon F. Royle
**Chromatic Number and the 2-Rank of a Graph.**[Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. B, 2001, v:81, n:1, pp:142-149 [Journal] - Gordon F. Royle, Alan D. Sokal
**The Brown-Colbourn conjecture on zeros of reliability polynomials is false.**[Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. B, 2004, v:91, n:2, pp:345-360 [Journal] - Koenraad Audenaert, Chris D. Godsil, Gordon F. Royle, Terry Rudolph
**Symmetric squares of graphs.**[Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. B, 2007, v:97, n:1, pp:74-90 [Journal] - Gordon F. Royle
**The Transitive Groups of Degree Twelve.**[Citation Graph (0, 0)][DBLP] J. Symb. Comput., 1987, v:4, n:2, pp:255-268 [Journal] - Gordon F. Royle, Cheryl E. Praeger
**Constructing the Vertex-Transitive Graphs of Order 24.**[Citation Graph (0, 0)][DBLP] J. Symb. Comput., 1989, v:8, n:4, pp:309-326 [Journal] - P. H. Fisher, Tim Penttila, Gordon F. Royle
**Symmetric designs, polarities and sub-designs.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1988, v:71, n:1, pp:19-32 [Journal] - Gordon F. Royle
**An orderly algorithm and some applications in finite geometry.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1998, v:185, n:1-3, pp:105-115 [Journal] - Yeow Meng Chee, Gordon F. Royle
**The 2-rotational Steiner triple systems of order 25.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1991, v:97, n:1-3, pp:93-100 [Journal] - Anthony D. Gardiner, Chris D. Godsil, A. D. Hensel, Gordon F. Royle
**Second neighbourhoods of strongly regular graphs.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1992, v:103, n:2, pp:161-170 [Journal] - Donald L. Kreher, Gordon F. Royle, W. D. Wallis
**A family of resolvable regular graph designs.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1996, v:156, n:1-3, pp:269-275 [Journal] **Java as a teaching language—opportunities, pitfalls and solutions.**[Citation Graph (, )][DBLP]**Graphs with Chromatic Roots in the Interval (1, 2).**[Citation Graph (, )][DBLP]
Search in 0.005secs, Finished in 0.006secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |