Algebraic graph theory C Godsil, GF Royle Springer Science & Business Media, 2001 | 10721 | 2001 |
Algebraic combinatorics C Godsil Routledge, 2017 | 1584 | 2017 |
Zero forcing sets and the minimum rank of graphs AIM Minimum Rank–Special Graphs Work Group Linear algebra and its applications 428 (7), 1628-1648, 2008 | 448 | 2008 |
Graduate texts in mathematics C Godsil, G Royle Algebraic graph theory 207, 2001 | 384 | 2001 |
On the theory of the matching polynomial CD Godsil, I Gutman Journal of Graph Theory 5 (2), 137-144, 1981 | 349 | 1981 |
On the full automorphism group of a graph CD Godsil Combinatorica 1, 243-256, 1981 | 346 | 1981 |
Constructing cospectral graphs CD Godsil, BD McKay Aequationes Mathematicae 25, 257-268, 1982 | 326 | 1982 |
A new graph product and its spectrum CD Godsil, BD McKay Bulletin of the Australian Mathematical Society 18 (1), 21-28, 1978 | 266 | 1978 |
Erdos–Ko–Rado theorems: algebraic approaches C Godsil, K Meagher Cambridge University Press, 2015 | 241 | 2015 |
State transfer on graphs C Godsil Discrete Mathematics 312 (1), 129-147, 2012 | 219 | 2012 |
Equiangular lines, mutually unbiased bases, and spin models C Godsil, A Roy European Journal of Combinatorics 30 (1), 246-262, 2009 | 163 | 2009 |
Feasibility conditions for the existence of walk-regular graphs CD Godsil, BD Mckay Linear algebra and its applications 30, 51-61, 1980 | 163 | 1980 |
Distance regular covers of the complete graph CD Godsil, AD Hensel Journal of Combinatorial Theory, Series B 56 (2), 205-238, 1992 | 137 | 1992 |
Matchings and walks in graphs CD Godsil Journal of Graph Theory 5 (3), 285-297, 1981 | 135 | 1981 |
GRRs for nonsolvable groups CD Godsil Algebraic methods in graph theory, {Vol. I, II (Szeged, 1978) 25, 221-239, 1978 | 133 | 1978 |
Number-theoretic nature of communication in quantum spin systems C Godsil, S Kirkland, S Severini, J Smith Physical review letters 109 (5), 050502, 2012 | 131 | 2012 |
When can perfect state transfer occur? C Godsil arXiv preprint arXiv:1011.0231, 2010 | 118 | 2010 |
A new proof of the Erdős–Ko–Rado theorem for intersecting families of permutations C Godsil, K Meagher European Journal of Combinatorics 30 (2), 404-414, 2009 | 115 | 2009 |
Periodic graphs C Godsil arXiv preprint arXiv:0806.2074, 2008 | 112 | 2008 |
On the matching polynomial of a graph CD Godsil, I Gutman University of Melbourne, 1978 | 110 | 1978 |