Chris D. Godsil

According to our database1, Chris D. Godsil authored at least 69 papers between 1980 and 2018.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of one.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2018
A New Perspective on the Average Mixing Matrix.
Electr. J. Comb., 2018

2017
Perfect state transfer is poly-time.
Quantum Information & Computation, 2017

Hardness of computing clique number and chromatic number for Cayley graphs.
Eur. J. Comb., 2017

Universal Completability, Least Eigenvalue Frameworks, and Vector Colorings.
Discrete & Computational Geometry, 2017

Uniform Mixing on Cayley Graphs.
Electr. J. Comb., 2017

Uniform Mixing and Association Schemes.
Electr. J. Comb., 2017

Quantum Walks on Generalized Quadrangles.
Electr. J. Comb., 2017

An algebraic proof of the Erdős-Ko-Rado theorem for intersecting families of perfect matchings.
Ars Math. Contemp., 2017

2016
Entropy of symmetric graphs.
Discrete Mathematics, 2016

Sabidussi versus Hedetniemi for three variations of the chromatic number.
Combinatorica, 2016

2015
Graph Cores via Universal Completability.
Electronic Notes in Discrete Mathematics, 2015

2013
Perfect state transfer on signed graphs.
Quantum Information & Computation, 2013

Average mixing of continuous quantum walks.
J. Comb. Theory, Ser. A, 2013

The inertia of distance matrices of some graphs.
Discrete Mathematics, 2013

2012
State transfer on graphs.
Discrete Mathematics, 2012

2011
Quantum Walks on Regular Graphs and Eigenvalues.
Electr. J. Comb., 2011

Periodic Graphs.
Electr. J. Comb., 2011

2010
Type-II matrices and combinatorial structures.
Combinatorica, 2010

2009
Equiangular lines, mutually unbiased bases, and spin models.
Eur. J. Comb., 2009

A new proof of the Erdös-Ko-Rado theorem for intersecting families of permutations.
Eur. J. Comb., 2009

2008
Two Characterizations of Crooked Functions.
IEEE Trans. Information Theory, 2008

Coloring an Orthogonality Graph.
SIAM J. Discrete Math., 2008

Eigenvalue bounds for independent sets.
J. Comb. Theory, Ser. B, 2008

2007
Symmetric squares of graphs.
J. Comb. Theory, Ser. B, 2007

Representations of directed strongly regular graphs.
Eur. J. Comb., 2007

2006
Colouring lines in projective space.
J. Comb. Theory, Ser. A, 2006

Independent Sets In Association Schemes.
Combinatorica, 2006

2004
Bose-Mesner algebras attached to invertible Jones pairs.
J. Comb. Theory, Ser. A, 2004

2003
Width and dual width of subsets in polynomial association schemes.
J. Comb. Theory, Ser. A, 2003

A permutation group determined by an ordered set.
Discrete Mathematics, 2003

2001
Chromatic Number and the 2-Rank of a Graph.
J. Comb. Theory, Ser. B, 2001

Algebraic Graph Theory.
Graduate texts in mathematics, Springer, ISBN: 978-0-387-95220-8, 2001

1998
Antipodal Distance Transitive Covers of Complete Graphs.
Eur. J. Comb., 1998

1995
Quotients of Association Schemes.
J. Comb. Theory, Ser. A, 1995

Problems in Algebraic Combinatorics.
Electr. J. Comb., 1995

Algebraic Matching Theory.
Electr. J. Comb., 1995

1993
Algebraic combinatorics.
Chapman and Hall mathematics series, Chapman and Hall, ISBN: 978-0-412-04131-0, 1993

1992
Distance regular covers of the complete graph.
J. Comb. Theory, Ser. B, 1992

Graphs with polynomial growth are covering graphs.
Graphs and Combinatorics, 1992

Second neighbourhoods of strongly regular graphs.
Discrete Mathematics, 1992

On the p-Rank of Incidence Matrices and a Bound of Bruen and Ott.
Des. Codes Cryptography, 1992

Walk Generating Functions, Christoffel-Darboux Identities and the Adjacency Matrix of a Graph.
Combinatorics, Probability & Computing, 1992

Krein covers of complete graphs.
Australasian J. Combinatorics, 1992

1990
Asymptotic enumeration of Latin rectangles.
J. Comb. Theory, Ser. B, 1990

1989
A note on bounded automorphisms of infinite graphs.
Graphs and Combinatorics, 1989

Polynomial spaces.
Discrete Mathematics, 1989

1988
Distance-regular antipodai covering graphs.
J. Comb. Theory, Ser. B, 1988

The chromatic connectivity of graphs.
Graphs and Combinatorics, 1988

Intersection Graphs for Families of Balls in Rn.
Eur. J. Comb., 1988

Bouding the diameter of distance-regular graphs.
Combinatorica, 1988

1987
Distance-regularised graphs are distance-regular or distance-biregular.
J. Comb. Theory, Ser. B, 1987

Reconstructing graphs from their k-edge deleted subgraphs.
J. Comb. Theory, Ser. B, 1987

Embedding graphs in Cayley graphs.
Graphs and Combinatorics, 1987

1985
Inverses of trees.
Combinatorica, 1985

1983
Graphs with three mutually pseudo-similar vertices.
J. Comb. Theory, Ser. B, 1983

The Automorphism Groups of Some Cubic Cayley Graphs.
Eur. J. Comb., 1983

1982
Some graphs with characteristic polynomials which are not solvable by radicals.
Journal of Graph Theory, 1982

Constructing graphs with pairs of pseudo-similar vertices.
J. Comb. Theory, Ser. B, 1982

On the Automorphism Groups of almost all Cayley Graphs.
Eur. J. Comb., 1982

Problem 25.
Discrete Mathematics, 1982

1981
On the theory of the matching polynomial.
Journal of Graph Theory, 1981

Matchings and walks in graphs.
Journal of Graph Theory, 1981

Spectral conditions for the reconstructibility of a graph.
J. Comb. Theory, Ser. B, 1981

Matching behaviour is asymptotically normal.
Combinatorica, 1981

Hermite polynomials and a duality relation for matchings polynomials.
Combinatorica, 1981

On the full automorphism group of a graph.
Combinatorica, 1981

Equiarboreal graphs.
Combinatorica, 1981

1980
Neighbourhoods of transitive graphs and GRR's.
J. Comb. Theory, Ser. B, 1980

More odd graph theory.
Discrete Mathematics, 1980


  Loading...