| The approximate solution of elliptic boundary-value problems by fundamental solutions R Mathon, RL Johnston SIAM Journal on Numerical Analysis 14 (4), 638-650, 1977 | 471 | 1977 |
| A note on the graph isomorphism counting problem R Mathon Information Processing Letters 8 (3), 131-132, 1979 | 315 | 1979 |
| 2-(v, k, λ) Designs of Small Order R Mathon, A Rosa Handbook of Combinatorial Designs 42, 25, 2007 | 247 | 2007 |
| Small Steiner triple systems and their properties RA Mathon, KT Phelps, A Rosa Ars Combin 15, 3-110, 1983 | 213 | 1983 |
| On cyclic Steiner 2-designs MJ Colbourn, RA Mathon Ann. Discrete Math 7, 215-253, 1980 | 141 | 1980 |
| Boundary methods for solving elliptic problems with singularities and interfaces ZC Li, P Mathon, R: Sermer SIAM journal on numerical analysis 24 (3), 487-498, 1987 | 125 | 1987 |
| Steiner Systems CJ Colbourn, R Mathon The CRC handbook of combinatorial designs, 66, 1996 | 118* | 1996 |
| Tables of Parameters of BIBDs with r⩽ 41 including Existence, Enumeration, and Resolvability Results R Mathon, A Rosa North-Holland mathematics studies 114, 275-307, 1985 | 96 | 1985 |
| Constructions for cyclic Steiner 2-designs R Mathon Ann. Discrete Math 34, 353-362, 1987 | 93 | 1987 |
| Tables of two-graphs FC Bussemaker, RA Mathon, JJ Seidel Combinatorics and Graph Theory: Proceedings of the Symposium Held at the …, 1981 | 75 | 1981 |
| Symmetric conference matrices of order pq^2+ 1 R Mathon Canad. J. Math 30 (2), 321-331, 1978 | 70 | 1978 |
| 3-class association schemes R Mathon Proceedings of the Conference on Algebraic Aspects of Combinatorics (Univ …, 1975 | 67 | 1975 |
| Sample graphs for isomorphism testing R Mathon Congressus Numerantium 21, 499-517, 1978 | 65 | 1978 |
| A census of Mendelsohn triple systems of order nine R Mathon, A Rosa Ars Combin 4, 309-315, 1977 | 65 | 1977 |
| New maximal arcs in Desarguesian planes R Mathon Journal of Combinatorial Theory, Series A 97 (2), 353-368, 2002 | 64 | 2002 |
| Lower bounds for Ramsey numbers and association schemes R Mathon Journal of Combinatorial Theory, Series B 42 (1), 122-127, 1987 | 64 | 1987 |
| Algorithmic techniques for the generation and analysis of strongly regular graphs and other combinatorial configurations DG Corneil, RA Mathon Annals of Discrete Mathematics 2, 1-32, 1978 | 60 | 1978 |
| TABLES OF PARAMETERS OF BIBDS WITH R-LESS-THAN-OR-EQUAL-TO 41 INCLUDING EXISTENCE, ENUMERATION AND RESOLVABILITY RESULTS-AN UPDATE R Mathon, A Rosa Ars Combinatoria 30, 65-96, 1990 | 57 | 1990 |
| Construction methods for Bhaskar Rao and related designs PB Gibbons, R Mathon J. Austral. Math. Soc. Ser. A 42, 5-30, 1987 | 51 | 1987 |
| On the existence of doubly resolvable Kirkman systems and equidistant permutation arrays R Mathon, SA Vanstone Discrete Mathematics 30 (2), 157-172, 1980 | 49 | 1980 |
Rosa *AProfessor of Mathematics, McMaster UniversityVerified email at mcmaster.ca
