6 citations · 13 across the 5 of their papers we have counts for
5 papers
Counting closed walks in infinite regular trees using Catalan and Borel's triangles
Lord C. Kavi, Michael W. Newman
We count the number of closed walks on a vertex in a regular tree using the Catalan's triangle and also the Borel's triangle, showing another combinatorial structure counted by the…
On the quantum chromatic number of a graph
Peter J. Cameron, Ashley Montanaro, Michael W. Newman +2
We investigate the notion of quantum chromatic number of a graph, which is the minimal number of colours necessary in a protocol in which two separated provers can convince an inte…
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…
Independent sets in association schemes
C. D. Godsil, M. W. Newman
Let be -regular graph on vertices and let denote the least eigenvalue of its adjacency matrix . If denotes the maximum size of an independent set in …