According to our database
1,
Chris D. Godsil
authored at least 83 papers
between 1980 and 2024.
Collaborative distances:
-
Dijkstra number2 of
four.
-
Erdős number3 of
one.
2024
Strongly cospectral vertices.
Australas. J Comb., February, 2024
2023
Irrational Quantum Walks.
SIAM J. Appl. Algebra Geom., September, 2023
Strongly cospectral vertices in normal Cayley graphs.
Discret. Math., May, 2023
On state transfer in Cayley graphs for abelian groups.
Quantum Inf. Process., 2023
Diagonal entries of the average mixing matrix.
Australas. J Comb., 2023
2022
Of shadows and gaps in spatial search.
Quantum Inf. Comput., 2022
2021
Graph covers with two new eigenvalues.
Eur. J. Comb., 2021
2020
Quantum Inf. Process., 2020
Vector coloring the categorical product of graphs.
Math. Program., 2020
State transfer in strongly regular graphs with an edge perturbation.
J. Comb. Theory, Ser. A, 2020
2019
Discrete-time quantum walks and graph structures.
J. Comb. Theory, Ser. A, 2019
Algebras, Graphs and Thetas.
Proceedings of the tenth Latin and American Algorithms, Graphs and Optimization Symposium, 2019
Graph homomorphisms via vector colorings.
Eur. J. Comb., 2019
Using the existence of t-designs to prove Erdős-Ko-Rado.
Discret. Math., 2019
2018
A New Perspective on the Average Mixing Matrix.
Electron. J. Comb., 2018
2017
Perfect state transfer is poly-time.
Quantum Inf. Comput., 2017
Hardness of computing clique number and chromatic number for Cayley graphs.
Eur. J. Comb., 2017
Universal Completability, Least Eigenvalue Frameworks, and Vector Colorings.
Discret. Comput. Geom., 2017
Uniform Mixing on Cayley Graphs.
Electron. J. Comb., 2017
Uniform Mixing and Association Schemes.
Electron. J. Comb., 2017
Quantum Walks on Generalized Quadrangles.
Electron. 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.
Discret. Math., 2016
Sabidussi versus Hedetniemi for three variations of the chromatic number.
Comb., 2016
2015
Graph Cores via Universal Completability.
Electron. Notes Discret. Math., 2015
2013
Perfect state transfer on signed graphs.
Quantum Inf. Comput., 2013
Average mixing of continuous quantum walks.
J. Comb. Theory, Ser. A, 2013
The inertia of distance matrices of some graphs.
Discret. Math., 2013
2012
State transfer on graphs.
Discret. Math., 2012
2011
Quantum Walks on Regular Graphs and Eigenvalues.
Electron. J. Comb., 2011
2010
Type-II matrices and combinatorial structures.
Comb., 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. Inf. Theory, 2008
Coloring an Orthogonality Graph.
SIAM J. Discret. 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.
Comb., 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.
Discret. Math., 2003
2001
Chromatic Number and the 2-Rank of a Graph.
J. Comb. Theory, Ser. B, 2001
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.
Electron. J. Comb., 1995
Algebraic Matching Theory.
Electron. J. Comb., 1995
1993
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 Comb., 1992
Second neighbourhoods of strongly regular graphs.
Discret. Math., 1992
On the p-Rank of Incidence Matrices and a Bound of Bruen and Ott.
Des. Codes Cryptogr., 1992
Walk Generating Functions, Christoffel-Darboux Identities and the Adjacency Matrix of a Graph.
Comb. Probab. Comput., 1992
Krein covers of complete graphs.
Australas. J Comb., 1992
1990
Asymptotic enumeration of Latin rectangles.
J. Comb. Theory, Ser. B, 1990
1989
A note on bounded automorphisms of infinite graphs.
Graphs Comb., 1989
1988
Distance-regular antipodai covering graphs.
J. Comb. Theory, Ser. B, 1988
The chromatic connectivity of graphs.
Graphs Comb., 1988
Intersection Graphs for Families of Balls in R<sup>n</sup>.
Eur. J. Comb., 1988
Bouding the diameter of distance-regular graphs.
Comb., 1988
1987
Distance-regularised graphs are distance-regular or distance-biregular.
J. Comb. Theory, Ser. B, 1987
Reconstructing graphs from their <i>k</i>-edge deleted subgraphs.
J. Comb. Theory, Ser. B, 1987
Embedding graphs in Cayley graphs.
Graphs Comb., 1987
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.
J. 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
1981
On the theory of the matching polynomial.
J. Graph Theory, 1981
Matchings and walks in graphs.
J. Graph Theory, 1981
Spectral conditions for the reconstructibility of a graph.
J. Comb. Theory, Ser. B, 1981
Matching behaviour is asymptotically normal.
Comb., 1981
Hermite polynomials and a duality relation for matchings polynomials.
Comb., 1981
On the full automorphism group of a graph.
Comb., 1981
1980
Neighbourhoods of transitive graphs and GRR's.
J. Comb. Theory, Ser. B, 1980