Hamilton cycles in digraphs of unitary matrices (Q856886): Difference between revisions

Let \(V(D)\) be the vertex set of a digraph \(D\). A set \(S\subseteq V(D)\) is a \(q^+\)-set (\(q^-\)-set, respectively) if \(| S| \geq 2\) and, for every \(u\in S\), there exists a vertex \(v\in(S-\{u\})\) such that \(N^+(u)\cap N^+(v)\neq\emptyset\) (\(N^-(u)\cap N^-(v)\neq\emptyset\), respectively). A digraph is called \(s\)-quadrangular if \(| \bigcup\{N^+(u)\cap N^+(v):u,v\in S,u\neq v\}| \geq| S| \) for every \(q^+\)-set and \(| \bigcup\{N^-(u)\cap N^-(v):u,v\in S,u\neq v\}| \geq| S| \) for every \(q^-\)-set. The authors conjecture that every strong \(s\)-quadrangular digraph is Hamiltonian and provide some support for this conjecture. For example, Theorem 2.3 says: If the out-degree and in-degree of every vertex in a strong \(s\)-quadrangular digraph \(D\) are at most 3, then \(D\) is Hamiltonian.