Zobrazeno 1 - 10
of 138
pro vyhledávání: '"Godsil, C."'
Publikováno v:
Quantum Information and Computation, vol. 13, no. 5&6, pages 511-530, 2013
We study perfect state transfer of quantum walks on signed graphs. Our aim is to show that negative edges are useful for perfect state transfer. Specific results we prove include: (1) The signed join of a negative 2-clique with any positive (n,3)-reg
Externí odkaz:
http://arxiv.org/abs/1211.0505
Autor:
Godsil, C. D., Zaks, J.
Let $G$ be the graph with the points of the unit sphere in $\mathbb{R}^3$ as its vertices, by defining two unit vectors to be adjacent if they are orthogonal as vectors. We present a proof, based on work of Hales and Straus chromatic number of this g
Externí odkaz:
http://arxiv.org/abs/1201.0486
Autor:
Godsil, C. D., Newman, M. W.
We deal with a graph colouring problem that arises in quantum information theory. Alice and Bob are each given a $\pm1$-vector of length $k$, and are to respond with $k$ bits. Their responses must be equal if they are given equal inputs, and distinct
Externí odkaz:
http://arxiv.org/abs/math/0509151
Autor:
Godsil, C. D., Newman, M. W.
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 number of the Erd\H{o}s-R\'{e}nyi graphs. We investigate further prop
Externí odkaz:
http://arxiv.org/abs/math/0508081
Autor:
Godsil, C. D., Newman, M. W.
Let $X$ be $k$-regular graph on $v$ vertices and let $\tau$ denote the least eigenvalue of its adjacency matrix $A(X)$. If $\alpha(X)$ denotes the maximum size of an independent set in $X$, we have the following well known bound: \[ \alpha(X) \le\fra
Externí odkaz:
http://arxiv.org/abs/math/0311535
Publikováno v:
In Linear Algebra and Its Applications 1 January 2016 488:264-283
Publikováno v:
In Linear Algebra and Its Applications 1 August 2015 478:108-130
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.