The SCEAS System
| |||||||

## Search the dblp DataBase
Chris D. Godsil:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Chris D. Godsil
**Problems in Algebraic Combinatorics.**[Citation Graph (0, 0)][DBLP] Electr. J. Comb., 1995, v:2, n:, pp:- [Journal] - Chris D. Godsil
**Walk Generating Functions, Christoffel-Darboux Identities and the Adjacency Matrix of a Graph.**[Citation Graph (0, 0)][DBLP] Combinatorics, Probability & Computing, 1992, v:1, n:, pp:13-25 [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] - Anders Claesson, Chris D. Godsil, David G. Wagner
**A permutation group determined by an ordered set.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2003, v:269, n:1-3, pp:273-279 [Journal] - Chris D. Godsil, Robert A. Liebler, Cheryl E. Praeger
**Antipodal Distance Transitive Covers of Complete Graphs.**[Citation Graph (0, 0)][DBLP] Eur. J. Comb., 1998, v:19, n:4, pp:455-478 [Journal] - Robert E. L. Aldred, Chris D. Godsil
**Distance-regular antipodai covering graphs.**[Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. B, 1988, v:45, n:2, pp:127-134 [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] - Chris D. Godsil, A. D. Hensel
**Distance regular covers of the complete graph.**[Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. B, 1992, v:56, n:2, pp:205-238 [Journal] - Chris D. Godsil, William Kocay
**Constructing graphs with pairs of pseudo-similar vertices.**[Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. B, 1982, v:32, n:2, pp:146-155 [Journal] - Chris D. Godsil, William Kocay
**Graphs with three mutually pseudo-similar vertices.**[Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. B, 1983, v:35, n:3, pp:240-246 [Journal] - Chris D. Godsil, Ilia Krasikov, Yehuda Roditty
**Reconstructing graphs from their**[Citation Graph (0, 0)][DBLP]*k*-edge deleted subgraphs. J. Comb. Theory, Ser. B, 1987, v:43, n:3, pp:360-363 [Journal] - Chris D. Godsil, Brendan D. McKay
**Asymptotic enumeration of Latin rectangles.**[Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. B, 1990, v:48, n:1, pp:19-44 [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] - Chris D. Godsil, John Shawe-Taylor
**Distance-regularised graphs are distance-regular or distance-biregular.**[Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. B, 1987, v:43, n:1, pp:14-24 [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] - Chris D. Godsil, Brendan D. McKay
**Spectral conditions for the reconstructibility of a graph.**[Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. B, 1981, v:30, n:3, pp:285-289 [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] **Representations of directed strongly regular graphs.**[Citation Graph (, )][DBLP]**Equiangular lines, mutually unbiased bases, and spin models.**[Citation Graph (, )][DBLP]
Search in 0.033secs, Finished in 0.034secs | |||||||

| |||||||

| |||||||

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