C. Godsil

most citedColouring an Orthogonality Graph

6 citations · 12 across the 6 of their papers we have counts for

collaborators

Showing math.COShow all

6 papers · 1 filter

math.CO2005★ 6 cited

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 $\pm 1$ -vector of length $k$ , and are to respond with $k$ bits. Thei…

math.CO2005★ 2 cited

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…

math.CO2005★ 1 cited

Colouring Lines in Projective Space

Ameera Chowdhury, Chris Godsil, Gordon Royle

Let $V$ be a vector space of dimension $v$ over a field of order $q$ . The $q$ -Kneser graph has the $k$ -dimensional subspaces of $V$ as its vertices, where two subspaces $α$ and $β$ …

math.CO2005★ 1 cited

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…

math.CO2003★ 2 cited

Independent sets in association schemes

C. D. Godsil, M. W. Newman

Let $X$ be $k$ -regular graph on $v$ vertices and let $τ$ denote the least eigenvalue of its adjacency matrix $A (X)$ . If $α (X)$ denotes the maximum size of an independent set in $X$ …

math.CO2003

Bose-Mesner Algebras attached to Invertible Jones Pairs

Ada Chan, Chris Godsil

In 1989, Vaughan Jones introduced spin models and showed that they could be used to form link invariants in two different ways--by constructing representations of the braid group,…