6 citations · 10 across the 4 of their papers we have counts for
4 papers
Colouring an Orthogonality Graph
C. D. Godsil, M. W. Newman
We deal with a graph colouring problem that arises in quantum information theory. Alice and Bob are each given a -vector of length , and are to respond with bits. Thei…
Eigenvalue bounds for independent sets
C. D. Godsil, M. W. Newman
We derive bounds on the size of an independent set based on eigenvalues. This generalizes a result due to Delsarte and Hoffman. We use this to obtain new bounds on the independence…
Colouring Lines in Projective Space
Ameera Chowdhury, Chris Godsil, Gordon Royle
Let be a vector space of dimension over a field of order . The -Kneser graph has the -dimensional subspaces of as its vertices, where two subspaces and …
Symmetric Squares of Graphs
Koenraad Audenaert, Chris Godsil, Gordon Royle +1
We consider symmetric powers of a graph. In particular, we show that the spectra of the symmetric square of strongly regular graphs with the same parameters are equal. We also prov…