Chris D. Godsil - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 62 from 62

2024

Hamiltonians of Bipartite WalksQiuting Chen, Chris D. Godsil, Mariia Sobchuk, Hanmeng Zhan. combinatorics, 31(4), 2024. [doi]

Strongly cospectral verticesChris D. Godsil, Jamie Smith. ajc, 88:1-21, February 2024. [doi]

2023

Irrational Quantum WalksGabriel Coutinho, Pedro Ferreira Baptista, Chris D. Godsil, Thomás Jung Spier, Reinhard Werner. siaga, 7(3):567-584, September 2023. [doi]

Diagonal entries of the average mixing matrixChris D. Godsil, Krystal Guo, Mariia Sobchuk. ajc, 86:373-386, 2023. [doi]

On state transfer in Cayley graphs for abelian groupsArnbjörg Soffía Árnadóttir, Chris D. Godsil. qip, 22(1):8, 2023. [doi]

Strongly cospectral vertices in normal Cayley graphsArnbjörg Soffía Árnadóttir, Chris D. Godsil. DM, 346(5):113341, May 2023. [doi]

2022

Of shadows and gaps in spatial searchAda Chan, Chris D. Godsil, Christino Tamon, Weichen Xie. qic, 22(13&14):1110-1131, 2022. [doi]

2020

Pair state transferQiuting Chen, Chris D. Godsil. qip, 19(9):321, 2020. [doi]

State transfer in strongly regular graphs with an edge perturbationChris D. Godsil, Krystal Guo, Mark Kempton, Gabor Lippner, Florentin Münch. jcta, 172:105181, 2020. [doi]

Vector coloring the categorical product of graphsChris D. Godsil, David E. Roberson, Brendan Rooney, Robert Sámal, Antonios Varvitsiotis. mp, 182(1):275-314, 2020. [doi]

2019

Algebras, Graphs and ThetasMarcel Kenji de Carli Silva, Gabriel Coutinho, Chris D. Godsil, David E. Roberson. ENTCS, 346:275-283, 2019. [doi]

Discrete-time quantum walks and graph structuresChris D. Godsil, Hanmeng Zhan. JCT, 167:181-212, 2019. [doi]

Using the existence of t-designs to prove Erdős-Ko-RadoChris D. Godsil, Krystal Guo. DM, 342(10):2846-2849, 2019. [doi]

Graph homomorphisms via vector coloringsChris D. Godsil, David E. Roberson, Brendan Rooney, Robert Sámal, Antonios Varvitsiotis. ejc, 79:244-261, 2019. [doi]

2018

A New Perspective on the Average Mixing MatrixGabriel Coutinho, Chris D. Godsil, Krystal Guo, Hanmeng Zhan. combinatorics, 25(4):4, 2018. [doi]

2017

Perfect state transfer is poly-timeGabriel Coutinho, Chris D. Godsil. qic, 17(5&6):495-502, 2017. [doi]

Uniform Mixing and Association SchemesChris D. Godsil, Natalie Mullin, Aidan Roy. combinatorics, 24(3):3, 2017. [doi]

An algebraic proof of the Erdős-Ko-Rado theorem for intersecting families of perfect matchingsChris D. Godsil, Karen Meagher. arsmc, 12(2):205-217, 2017. [doi]

Uniform Mixing on Cayley GraphsChris D. Godsil, Hanmeng Zhan. combinatorics, 24(3):3, 2017. [doi]

Quantum Walks on Generalized QuadranglesChris D. Godsil, Krystal Guo, Tor G. J. Myklebust. combinatorics, 24(4):4, 2017. [doi]

Hardness of computing clique number and chromatic number for Cayley graphsChris D. Godsil, Brendan Rooney. ejc, 62:147-166, 2017. [doi]

Universal Completability, Least Eigenvalue Frameworks, and Vector ColoringsChris D. Godsil, David E. Roberson, Brendan Rooney, Robert Sámal, Antonios Varvitsiotis. dcg, 58(2):265-292, 2017. [doi]

2016

Sabidussi versus Hedetniemi for three variations of the chromatic numberChris D. Godsil, David E. Roberson, Robert Sámal, Simone Severini. combinatorica, 36(4):395-415, 2016. [doi]

Entropy of symmetric graphsSeyed Saeed Changiz Rezaei, Chris D. Godsil. DM, 339(2):475-483, 2016. [doi]

2015

Graph Cores via Universal CompletabilityChris D. Godsil, David Roberson, Brendan Rooney, Robert Sámal, Antonios Varvitsiotis. endm, 49:337-344, 2015. [doi]

2013

Perfect state transfer on signed graphsJohn Brown, Chris D. Godsil, Devlin Mallory, Abigail Raz, Christino Tamon. qic, 13(5-6):511-530, 2013. [doi]

Average mixing of continuous quantum walksChris D. Godsil. JCT, 120(7):1649-1662, 2013. [doi]

The inertia of distance matrices of some graphsXiaoling Zhang, Chris D. Godsil. DM, 313(16):1655-1664, 2013. [doi]

2012

State transfer on graphsChris D. Godsil. DM, 312(1):129-147, 2012. [doi]

2011

Periodic GraphsChris D. Godsil. combinatorics, 18(1), 2011. [doi]

Quantum Walks on Regular Graphs and EigenvaluesChris D. Godsil, Krystal Guo. combinatorics, 18(1), 2011. [doi]

2010

Type-II matrices and combinatorial structuresAda Chan, Chris D. Godsil. combinatorica, 30(1):1-24, 2010. [doi]

2009

Equiangular lines, mutually unbiased bases, and spin modelsChris D. Godsil, Aidan Roy. ejc, 30(1):246-262, 2009. [doi]

2008

Eigenvalue bounds for independent setsChris D. Godsil, M. W. Newman. JCT, 98(4):721-734, 2008. [doi]

Two Characterizations of Crooked FunctionsChris D. Godsil, Aidan Roy. TIT, 54(2):864-866, 2008. [doi]

Coloring an Orthogonality GraphChris D. Godsil, M. W. Newman. siamdm, 22(2):683-692, 2008. [doi]

2007

Symmetric squares of graphsKoenraad Audenaert, Chris D. Godsil, Gordon F. Royle, Terry Rudolph. JCT, 97(1):74-90, 2007. [doi]

Representations of directed strongly regular graphsChris D. Godsil, Sylvia A. Hobart, William J. Martin. ejc, 28(7):1980-1993, 2007. [doi]

2006

Colouring lines in projective spaceAmeera Chowdhury, Chris D. Godsil, Gordon F. Royle. JCT, 113(1):39-52, 2006. [doi]

2003

A permutation group determined by an ordered setAnders Claesson, Chris D. Godsil, David G. Wagner. DM, 269(1-3):273-279, 2003. [doi]

2001

Chromatic Number and the 2-Rank of a GraphChris D. Godsil, Gordon F. Royle. JCT, 81(1):142-149, 2001. [doi]

1998

Antipodal Distance Transitive Covers of Complete GraphsChris D. Godsil, Robert A. Liebler, Cheryl E. Praeger. ejc, 19(4):455-478, 1998. [doi]

1995

Problems in Algebraic CombinatoricsChris D. Godsil. combinatorics, 2, 1995. [doi]

1993

Algebraic combinatoricsChris D. Godsil. Chapman and Hall mathematics series, Chapman and Hall, 1993.

1992

On the p-Rank of Incidence Matrices and a Bound of Bruen and OttD. de Caen, Chris D. Godsil, Gordon F. Royle. dcc, 2(4):391-394, 1992.

Distance regular covers of the complete graphChris D. Godsil, A. D. Hensel. JCT, 56(2):205-238, 1992. [doi]

Krein covers of complete graphsChris D. Godsil. ajc, 6:245-256, 1992. [doi]

Walk Generating Functions, Christoffel-Darboux Identities and the Adjacency Matrix of a GraphChris D. Godsil. cpc, 1:13-25, 1992.

Graphs with polynomial growth are covering graphsChris D. Godsil, Norbert Seifter. gc, 8(3):233-241, 1992. [doi]

1990

Asymptotic enumeration of Latin rectanglesChris D. Godsil, Brendan D. McKay. JCT, 48(1):19-44, 1990. [doi]

1989

A note on bounded automorphisms of infinite graphsChris D. Godsil, Wilfried Imrich, Norbert Seifter, Mark E. Watkins, Wolfgang Woess. gc, 5(1):333-338, 1989. [doi]

1988

Distance-regular antipodai covering graphsRobert E. L. Aldred, Chris D. Godsil. JCT, 45(2):127-134, 1988. [doi]

nPaul Erdös, Chris D. Godsil, Steven G. Krantz, Torrence D. Parsons. ejc, 9(5):501-505, 1988. [doi]

1987

Reconstructing graphs from their ::::k::::-edge deleted subgraphsChris D. Godsil, Ilia Krasikov, Yehuda Roditty. JCT, 43(3):360-363, 1987. [doi]

Embedding graphs in Cayley graphsChris D. Godsil, Wilfried Imrich. gc, 3(1):39-43, 1987. [doi]

Distance-regularised graphs are distance-regular or distance-biregularChris D. Godsil, John Shawe-Taylor. JCT, 43(1):14-24, 1987. [doi]

1983

Graphs with three mutually pseudo-similar verticesChris D. Godsil, William Kocay. JCT, 35(3):240-246, 1983. [doi]

1982

On the Automorphism Groups of almost all Cayley GraphsLászló Babai, Chris D. Godsil. ejc, 3(1):9-15, 1982. [doi]

Constructing graphs with pairs of pseudo-similar verticesChris D. Godsil, William Kocay. JCT, 32(2):146-155, 1982. [doi]

1981

Matchings and walks in graphsChris D. Godsil. jgt, 5(3):285-297, 1981. [doi]

On the theory of the matching polynomialChris D. Godsil, Ivan Gutman. jgt, 5(2):137-144, 1981. [doi]

Spectral conditions for the reconstructibility of a graphChris D. Godsil, Brendan D. McKay. JCT, 30(3):285-289, 1981. [doi]

Sign in or sign up to see more results.

runs on WebDSL