| | |
C. D. Godsil
List of publications from the DBLP Bibliography Server - FAQ
- CSB - MetaPress - Google - Bing - Yahoo
 | 2012 | |
|---|---|---|
| 47 |      | Chris D. Godsil: State transfer on graphs. Discrete Mathematics 312(1): 129-147 (2012) |
| 2011 | ||
| 46 | | Chris D. Godsil: Periodic Graphs. Electr. J. Comb. 18(1): (2011) |
| 45 | | Chris D. Godsil, Krystal Guo: Quantum Walks on Regular Graphs and Eigenvalues. Electr. J. Comb. 18(1): (2011) |
| 2010 | ||
| 44 | | Ada Chan, Chris D. Godsil: Type-II matrices and combinatorial structures. Combinatorica 30(1): 1-24 (2010) |
| 2009 | ||
| 43 | | Chris D. Godsil, Aidan Roy: Equiangular lines, mutually unbiased bases, and spin models. Eur. J. Comb. 30(1): 246-262 (2009) |
| 42 | | Chris D. Godsil, Karen Meagher: A new proof of the Erdös-Ko-Rado theorem for intersecting families of permutations. Eur. J. Comb. 30(2): 404-414 (2009) |
| 2008 | ||
| 41 | | Chris D. Godsil, Aidan Roy: Two Characterizations of Crooked Functions. IEEE Transactions on Information Theory 54(2): 864-866 (2008) |
| 40 | | Chris D. Godsil, M. W. Newman: Eigenvalue bounds for independent sets. J. Comb. Theory, Ser. B 98(4): 721-734 (2008) |
| 39 | | Chris D. Godsil, M. W. Newman: Coloring an Orthogonality Graph. SIAM J. Discrete Math. 22(2): 683-692 (2008) |
| 2007 | ||
| 38 | | Chris D. Godsil, Sylvia A. Hobart, William J. Martin: Representations of directed strongly regular graphs. Eur. J. Comb. 28(7): 1980-1993 (2007) |
| 37 | | Koenraad Audenaert, Chris D. Godsil, Gordon F. Royle, Terry Rudolph: Symmetric squares of graphs. J. Comb. Theory, Ser. B 97(1): 74-90 (2007) |
| 2006 | ||
| 36 | | C. D. Godsil, M. W. Newman: Independent Sets In Association Schemes. Combinatorica 26(4): 431-443 (2006) |
| 35 | | Ameera Chowdhury, Chris D. Godsil, Gordon F. Royle: Colouring lines in projective space. J. Comb. Theory, Ser. A 113(1): 39-52 (2006) |
| 2004 | ||
| 34 | | Ada Chan, C. D. Godsil: Bose-Mesner algebras attached to invertible Jones pairs. J. Comb. Theory, Ser. A 106(2): 165-191 (2004) |
| 2003 | ||
| 33 | | Anders Claesson, Chris D. Godsil, David G. Wagner: A permutation group determined by an ordered set. Discrete Mathematics 269(1-3): 273-279 (2003) |
| 32 | | Andries E. Brouwer, C. D. Godsil, Jack H. Koolen, William J. Martin: Width and dual width of subsets in polynomial association schemes. J. Comb. Theory, Ser. A 102(2): 255-271 (2003) |
| 2001 | ||
| 31 | | Chris D. Godsil, Gordon F. Royle: Chromatic Number and the 2-Rank of a Graph. J. Comb. Theory, Ser. B 81(1): 142-149 (2001) |
| 1998 | ||
| 30 | | Chris D. Godsil, Robert A. Liebler, Cheryl E. Praeger: Antipodal Distance Transitive Covers of Complete Graphs. Eur. J. Comb. 19(4): 455-478 (1998) |
| 1995 | ||
| 29 | | C. D. Godsil: Algebraic Matching Theory. Electr. J. Comb. 2: (1995) |
| 28 | | Chris D. Godsil: Problems in Algebraic Combinatorics. Electr. J. Comb. 2: (1995) |
| 27 |  | C. D. Godsil, William J. Martin: Quotients of Association Schemes. J. Comb. Theory, Ser. A 69(2): 185-199 (1995) |
| 1993 | ||
| 26 | | Chris D. Godsil: Algebraic combinatorics. Chapman and Hall 1993: I-XV, 1-362 |
| 1992 | ||
| 25 | | Chris D. Godsil: Walk Generating Functions, Christoffel-Darboux Identities and the Adjacency Matrix of a Graph. Combinatorics, Probability & Computing 1: 13-25 (1992) |
| 24 | | D. de Caen, Chris D. Godsil, Gordon F. Royle: On the p-Rank of Incidence Matrices and a Bound of Bruen and Ott. Des. Codes Cryptography 2(4): 391-394 (1992) |
| 23 | | Anthony D. Gardiner, Chris D. Godsil, A. D. Hensel, Gordon F. Royle: Second neighbourhoods of strongly regular graphs. Discrete Mathematics 103(2): 161-170 (1992) |
| 22 | | Chris D. Godsil, Norbert Seifter: Graphs with polynomial growth are covering graphs. Graphs and Combinatorics 8(3): 233-241 (1992) |
| 21 | | Chris D. Godsil, A. D. Hensel: Distance regular covers of the complete graph. J. Comb. Theory, Ser. B 56(2): 205-238 (1992) |
| 1990 | ||
| 20 | | Chris D. Godsil, Brendan D. McKay: Asymptotic enumeration of Latin rectangles. J. Comb. Theory, Ser. B 48(1): 19-44 (1990) |
| 1989 | ||
| 19 | | C. D. Godsil: Polynomial spaces. Discrete Mathematics 73(1-2): 71-88 (1989) |
| 18 | | Chris D. Godsil, Wilfried Imrich, Norbert Seifter, Mark E. Watkins, Wolfgang Woess: A note on bounded automorphisms of infinite graphs. Graphs and Combinatorics 5(1): 333-338 (1989) |
| 1988 | ||
| 17 | | C. D. Godsil: Bouding the diameter of distance-regular graphs. Combinatorica 8(4): 333-344 (1988) |
| 16 | | C. D. Godsil, Richard J. Nowakowski, Jaroslav Nesetril: The chromatic connectivity of graphs. Graphs and Combinatorics 4(1): 229-233 (1988) |
| 15 | | Robert E. L. Aldred, Chris D. Godsil: Distance-regular antipodai covering graphs. J. Comb. Theory, Ser. B 45(2): 127-134 (1988) |
| 1987 | ||
| 14 | | Chris D. Godsil, Wilfried Imrich: Embedding graphs in Cayley graphs. Graphs and Combinatorics 3(1): 39-43 (1987) |
| 13 | | Chris D. Godsil, John Shawe-Taylor: Distance-regularised graphs are distance-regular or distance-biregular. J. Comb. Theory, Ser. B 43(1): 14-24 (1987) |
| 12 | | Chris D. Godsil, Ilia Krasikov, Yehuda Roditty: Reconstructing graphs from their k-edge deleted subgraphs. J. Comb. Theory, Ser. B 43(3): 360-363 (1987) |
| 1985 | ||
| 11 | | C. D. Godsil: Inverses of trees. Combinatorica 5(1): 33-39 (1985) |
| 1983 | ||
| 10 | | Chris D. Godsil, William Kocay: Graphs with three mutually pseudo-similar vertices. J. Comb. Theory, Ser. B 35(3): 240-246 (1983) |
| 1982 | ||
| 9 | | C. D. Godsil: Problem 25. Discrete Mathematics 41(3): 331-332 (1982) |
| 8 | | Chris D. Godsil, William Kocay: Constructing graphs with pairs of pseudo-similar vertices. J. Comb. Theory, Ser. B 32(2): 146-155 (1982) |
| 1981 | ||
| 7 | | C. D. Godsil: Equiarboreal graphs. Combinatorica 1(2): 163-167 (1981) |
| 6 | | C. D. Godsil: On the full automorphism group of a graph. Combinatorica 1(3): 243-256 (1981) |
| 5 | | C. D. Godsil: Hermite polynomials and a duality relation for matchings polynomials. Combinatorica 1(3): 257-262 (1981) |
| 4 | | C. D. Godsil: Matching behaviour is asymptotically normal. Combinatorica 1(4): 369-376 (1981) |
| 3 | | Chris D. Godsil, Brendan D. McKay: Spectral conditions for the reconstructibility of a graph. J. Comb. Theory, Ser. B 30(3): 285-289 (1981) |
| 1980 | ||
| 2 | | C. D. Godsil: More odd graph theory. Discrete Mathematics 32(2): 205-207 (1980) |
| 1 | | C. D. Godsil: Neighbourhoods of transitive graphs and GRR's. J. Comb. Theory, Ser. B 29(1): 116-140 (1980) |
| 1 | Robert E. L. Aldred | [15] |
| 2 | Koenraad Audenaert | [37] |
| 3 | Andries E. Brouwer | [32] |
| 4 | Dominique de Caen (D. de Caen) | [24] |
| 5 | Ada Chan | [34] [44] |
| 6 | Ameera Chowdhury | [35] |
| 7 | Anders Claesson | [33] |
| 8 | Anthony D. Gardiner | [23] |
| 9 | Krystal Guo | [45] |
| 10 | A. D. Hensel | [21] [23] |
| 11 | Sylvia A. Hobart | [38] |
| 12 | Wilfried Imrich | [14] [18] |
| 13 | William Kocay | [8] [10] |
| 14 | Jacobus H. Koolen (Jack H. Koolen) | [32] |
| 15 | Ilia Krasikov | [12] |
| 16 | Robert A. Liebler | [30] |
| 17 | William J. Martin | [27] [32] [38] |
| 18 | Brendan D. McKay | [3] [20] |
| 19 | Karen Meagher | [42] |
| 20 | Jaroslav Nesetril (Jarik Nesetril) | [16] |
| 21 | M. W. Newman | [36] [39] [40] |
| 22 | Richard J. Nowakowski | [16] |
| 23 | Cheryl E. Praeger | [30] |
| 24 | Yehuda Roditty | [12] |
| 25 | Aidan Roy | [41] [43] |
| 26 | Gordon F. Royle | [23] [24] [31] [35] [37] |
| 27 | Terry Rudolph | [37] |
| 28 | Norbert Seifter | [18] [22] |
| 29 | John Shawe-Taylor | [13] |
| 30 | David G. Wagner | [33] |
| 31 | Mark E. Watkins | [18] |
| 32 | Wolfgang Woess | [18] |
Colors in the list of coauthors
Last update Fri Jun 1 15:44:53 2012 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page