Hamilton Cycles in Digraphs of Unitary Matrices

Details Hamilton Cycles in Digraphs of Unitary Matrices Hamilton Cycles in Digraphs of Unitary Matrices

2004-09-14

arxiv.org/abs/math/0409228v2

Discrete Mathematics 306 (2006), 3315-3320

Mathematics

Combinatorics

8 pages

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Hamilton Cycles in Digraphs of Unitary Matrices does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Hamilton Cycles in Digraphs of Unitary Matrices, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Hamilton Cycles in Digraphs of Unitary Matrices will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-415718