Остановите войну!
for scientists:
default search action
Chris D. Godsil
- > Home > Persons > Chris D. Godsil
Publications
- 2023
- [j79]Chris D. Godsil, Krystal Guo, Mariia Sobchuk:
Diagonal entries of the average mixing matrix. Australas. J Comb. 86: 373-386 (2023) - [j76]Gabriel Coutinho, Pedro Ferreira Baptista, Chris D. Godsil, Thomás Jung Spier, Reinhard Werner:
Irrational Quantum Walks. SIAM J. Appl. Algebra Geom. 7(3): 567-584 (2023) - 2022
- [j75]Ada Chan, Chris D. Godsil, Christino Tamon, Weichen Xie:
Of shadows and gaps in spatial search. Quantum Inf. Comput. 22(13&14): 1110-1131 (2022) - 2020
- [j73]Chris D. Godsil, Krystal Guo, Mark Kempton, Gabor Lippner, Florentin Münch:
State transfer in strongly regular graphs with an edge perturbation. J. Comb. Theory, Ser. A 172: 105181 (2020) - [j72]Chris D. Godsil, David E. Roberson, Brendan Rooney, Robert Sámal, Antonios Varvitsiotis:
Vector coloring the categorical product of graphs. Math. Program. 182(1): 275-314 (2020) - 2019
- [j70]Chris D. Godsil, Krystal Guo:
Using the existence of t-designs to prove Erdős-Ko-Rado. Discret. Math. 342(10): 2846-2849 (2019) - [j69]Chris D. Godsil, David E. Roberson, Brendan Rooney, Robert Sámal, Antonios Varvitsiotis:
Graph homomorphisms via vector colorings. Eur. J. Comb. 79: 244-261 (2019) - [j68]Chris D. Godsil, Hanmeng Zhan:
Discrete-time quantum walks and graph structures. J. Comb. Theory, Ser. A 167: 181-212 (2019) - [c1]Marcel Kenji de Carli Silva, Gabriel Coutinho, Chris D. Godsil, David E. Roberson:
Algebras, Graphs and Thetas. LAGOS 2019: 275-283 - 2018
- [j67]Gabriel Coutinho, Chris D. Godsil, Krystal Guo, Hanmeng Zhan:
A New Perspective on the Average Mixing Matrix. Electron. J. Comb. 25(4): 4 (2018) - 2017
- [j65]Chris D. Godsil, Natalie Mullin, Aidan Roy:
Uniform Mixing and Association Schemes. Electron. J. Comb. 24(3): 3 (2017) - [j64]Chris D. Godsil, Hanmeng Zhan:
Uniform Mixing on Cayley Graphs. Electron. J. Comb. 24(3): 3 (2017) - [j63]Chris D. Godsil, Krystal Guo, Tor G. J. Myklebust:
Quantum Walks on Generalized Quadrangles. Electron. J. Comb. 24(4): 4 (2017) - [j62]Chris D. Godsil, David E. Roberson, Brendan Rooney, Robert Sámal, Antonios Varvitsiotis:
Universal Completability, Least Eigenvalue Frameworks, and Vector Colorings. Discret. Comput. Geom. 58(2): 265-292 (2017) - [j61]Chris D. Godsil, Brendan Rooney:
Hardness of computing clique number and chromatic number for Cayley graphs. Eur. J. Comb. 62: 147-166 (2017) - [j60]Gabriel Coutinho, Chris D. Godsil:
Perfect state transfer is poly-time. Quantum Inf. Comput. 17(5&6): 495-502 (2017) - 2016
- [j59]Chris D. Godsil, David E. Roberson, Robert Sámal, Simone Severini:
Sabidussi versus Hedetniemi for three variations of the chromatic number. Comb. 36(4): 395-415 (2016) - 2015
- [j57]Chris D. Godsil, David E. Roberson, Brendan Rooney, Robert Sámal, Antonios Varvitsiotis:
Graph Cores via Universal Completability. Electron. Notes Discret. Math. 49: 337-344 (2015) - 2013
- [j54]John Brown, Chris D. Godsil, Devlin Mallory, Abigail Raz, Christino Tamon:
Perfect state transfer on signed graphs. Quantum Inf. Comput. 13(5-6): 511-530 (2013) - 2011
- [j51]Chris D. Godsil, Krystal Guo:
Quantum Walks on Regular Graphs and Eigenvalues. Electron. J. Comb. 18(1) (2011) - 2010
- [j50]Ada Chan, Chris D. Godsil:
Type-II matrices and combinatorial structures. Comb. 30(1): 1-24 (2010) - 2009
- [j49]Chris D. Godsil, Aidan Roy:
Equiangular lines, mutually unbiased bases, and spin models. Eur. J. Comb. 30(1): 246-262 (2009) - 2008
- [j47]Chris D. Godsil, Michael W. Newman:
Eigenvalue bounds for independent sets. J. Comb. Theory, Ser. B 98(4): 721-734 (2008) - [j46]Chris D. Godsil, Michael W. Newman:
Coloring an Orthogonality Graph. SIAM J. Discret. Math. 22(2): 683-692 (2008) - [j45]Chris D. Godsil, Aidan Roy:
Two Characterizations of Crooked Functions. IEEE Trans. Inf. Theory 54(2): 864-866 (2008) - 2007
- [j44]Chris D. Godsil, Sylvia A. Hobart, William J. Martin:
Representations of directed strongly regular graphs. Eur. J. Comb. 28(7): 1980-1993 (2007) - [j43]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
- [j42]Chris D. Godsil, Michael W. Newman:
Independent Sets In Association Schemes. Comb. 26(4): 431-443 (2006) - [j41]Ameera Chowdhury, Chris D. Godsil, Gordon F. Royle:
Colouring lines in projective space. J. Comb. Theory, Ser. A 113(1): 39-52 (2006) - 2004
- [j40]Ada Chan, Chris D. Godsil:
Bose-Mesner algebras attached to invertible Jones pairs. J. Comb. Theory, Ser. A 106(2): 165-191 (2004) - 2003
- [j38]Andries E. Brouwer, Chris 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
- [b2]Christopher D. Godsil, Gordon F. Royle:
Algebraic Graph Theory. Graduate texts in mathematics, Springer 2001, ISBN 978-0-387-95220-8, pp. I-XIX, 1-439 - [j37]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
- [j36]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
- [j33]Chris D. Godsil, William J. Martin:
Quotients of Association Schemes. J. Comb. Theory, Ser. A 69(2): 185-199 (1995) - 1992
- [j30]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 Cryptogr. 2(4): 391-394 (1992) - [j29]Anthony D. Gardiner, Chris D. Godsil, A. D. Hensel, Gordon F. Royle:
Second neighbourhoods of strongly regular graphs. Discret. Math. 103(2): 161-170 (1992) - [j28]Chris D. Godsil, Norbert Seifter:
Graphs with polynomial growth are covering graphs. Graphs Comb. 8(3): 233-241 (1992) - [j27]Chris D. Godsil, A. D. Hensel:
Distance regular covers of the complete graph. J. Comb. Theory, Ser. B 56(2): 205-238 (1992) - 1990
- [j26]Chris D. Godsil, Brendan D. McKay:
Asymptotic enumeration of Latin rectangles. J. Comb. Theory, Ser. B 48(1): 19-44 (1990) - 1989
- [j24]Chris D. Godsil, Wilfried Imrich, Norbert Seifter, Mark E. Watkins, Wolfgang Woess:
A note on bounded automorphisms of infinite graphs. Graphs Comb. 5(1): 333-338 (1989) - 1988
- [j22]Paul Erdös, Chris D. Godsil, Steven G. Krantz, Torrence D. Parsons:
Intersection Graphs for Families of Balls in Rn. Eur. J. Comb. 9(5): 501-505 (1988) - [j21]Chris D. Godsil, Richard J. Nowakowski, Jaroslav Nesetril:
The chromatic connectivity of graphs. Graphs Comb. 4(1): 229-233 (1988) - [j20]Robert E. L. Aldred, Chris D. Godsil:
Distance-regular antipodai covering graphs. J. Comb. Theory, Ser. B 45(2): 127-134 (1988) - 1987
- [j19]Chris D. Godsil, Wilfried Imrich:
Embedding graphs in Cayley graphs. Graphs Comb. 3(1): 39-43 (1987) - 1982
- [j12]László Babai, Chris D. Godsil:
On the Automorphism Groups of almost all Cayley Graphs. Eur. J. Comb. 3(1): 9-15 (1982) - 1981
- [j5]Chris D. Godsil, Brendan D. McKay:
Spectral conditions for the reconstructibility of a graph. J. Comb. Theory, Ser. B 30(3): 285-289 (1981)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-02-07 03:07 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint