M. Newman

most citedColouring an Orthogonality Graph

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

collaborators

Showing math.COShow all

3 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.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$ …