Hamilton Cycles in Digraphs of Unitary Matrices
| dc.creator | Gutin, Gregory | |
| dc.creator | Rafiey, Arash | |
| dc.creator | Severini, Simone | |
| dc.creator | Yeo, Anders | |
| dc.date | 2004-09-14 | |
| dc.date | 2006-11-07 | |
| dc.date.accessioned | 2026-07-07T06:38:47Z | |
| dc.date.available | 2026-07-07T06:38:47Z | |
| dc.description | A set $S\subseteq V$ is called an {\em $q^+$-set} ({\em $q^-$-set}, respectively) if $S$ has at least two vertices and, for every $u\in S$, there exists $v\in S, v\neq u$ such that $N^+(u)\cap N^+(v)\neq \emptyset$ ($N^-(u)\cap N^-(v)\neq \emptyset$, respectively). A digraph $D$ is called {\em s-quadrangular} if, for every $q^+$-set $S$, we have $|\cup \{N^+(u)\cap N^+(v): u\neq v, u,v\in S\}|\ge |S|$ and, for every $q^-$-set $S$, we have $|\cup \{N^-(u)\cap N^-(v): u,v\in S)\}\ge |S|$. We conjecture that every strong s-quadrangular digraph has a Hamilton cycle and provide some support for this conjecture. | |
| dc.description | 8 pages | |
| dc.identifier | https://arxiv.org/abs/math/0409228 | |
| dc.identifier | http://arxiv.org/abs/math/0409228 | |
| dc.identifier | Discrete Mathematics 306 (2006), 3315-3320 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/100863 | |
| dc.subject | Combinatorics | |
| dc.subject | Quantum Physics | |
| dc.subject | 05C50; 05C20; 05C45 | |
| dc.title | Hamilton Cycles in Digraphs of Unitary Matrices | |
| dc.type | text |