next up previous contents
Next: Results Up: Tournaments and their Related Previous: Definitions

Figures





Graph G and Adjacency Matrix A: \includegraphics[scale=0.4]{graph1.eps}

\begin{displaymath}A(G)=
\begin{array}{c}
1\\ 2\\ 3\\ 4\\
\end{array}\left[ \be...
...&1&0&0\\
1&0&0&1\\
0&0&0&1\\
0&1&1&0\\
\end{array} \right]
\end{displaymath}


Bipartite Graph G and Adjacency Matrix:



\includegraphics[scale=0.5]{graph2.eps}

\begin{displaymath}A(G)=
\begin{array}{c}
1\\ 2\\ 3\\ 4\\ 5\\
\end{array}\left[...
...0&0&1&0\\
0&1&0&0\\
0&0&1&0\\
1&1&0&1\\
\end{array}\right]
\end{displaymath}

Tournament(K) and its Matrix A(K)
\includegraphics[scale=0.5]{tournamentk5.eps}

\begin{displaymath}A(K)=
\begin{array}{c}
x_1\\ x_2\\ x_3\\ x_4\\ x_5\\
\end{ar...
...0\\
0&0&0&1&1\\
1&0&0&0&0\\
1&1&0&1&0\\
\end{array}\right]
\end{displaymath}




Tournament(K) and its Matrix AT(K)
\includegraphics[scale=0.5]{tournamentk5.eps}

\begin{displaymath}A^T(K)=
\begin{array}{c}
x_1\\ x_2\\ x_3\\ x_4\\ x_5\\
\end{...
...1\\
1&1&0&0&0\\
1&1&1&0&1\\
0&0&1&0&0\\
\end{array}\right]
\end{displaymath}




For a Tournament(K): A(K)+AT(K)=J-I

\begin{displaymath}\left[ \begin{array}{ccccc}
0&1&1&1&0\\
0&0&1&1&0\\
0&0&0&1...
...1\\
1&1&0&1&1\\
1&1&1&0&1\\
1&1&1&1&0\\
\end{array}\right] \end{displaymath}

Boolean Rank, b(A), of a {0,1}-matrix A

\begin{displaymath}A= \left[ \begin{array}{cccccc}
0&1&0&1&1&1\\
0&0&0&1&1&1\\ ...
...ay}{cccccc}
0&0&0&1&1&1\\
0&1&0&1&0&0\\
\end{array}\right]=
\end{displaymath}


\begin{displaymath}\left[ \begin{array}{c}
1\\ 1\\ 1\\ 0\\ 0\\ 0\\
\end{array} ...
...left[ \begin{array}{cccccc}
0&1&0&1&0&0\\
\end{array}\right]=
\end{displaymath}


\begin{displaymath}\left[ \begin{array}{cccccc}
0&0&0&1&1&1\\
0&0&0&1&1&1\\
0&...
...&0&0&0&0&0\\
0&1&0&1&0&0\\
0&1&0&1&0&0\\
\end{array}\right]
\end{displaymath}

Non-negative Integer Rank, rz+(A), of A(D)


\begin{displaymath}A= \left[ \begin{array}{cccccc}
0&1&0&1&1&1\\
0&0&0&1&1&1\\ ...
...0&0&1&1&1\\
0&1&0&0&0&0\\
0&0&0&1&0&0\\
\end{array}\right]=
\end{displaymath}


\begin{displaymath}\left[ \begin{array}{c}
1\\ 1\\ 1\\ 0\\ 0\\ 0\\
\end{array}\...
...left[ \begin{array}{cccccc}
0&0&0&1&0&0\\
\end{array}\right]=
\end{displaymath}


\begin{displaymath}\left[ \begin{array}{cccccc}
0&0&0&1&1&1\\
0&0&0&1&1&1\\
0&...
...&0&0&0&0&0\\
0&0&0&1&0&0\\
0&0&0&1&0&0\\
\end{array}\right]
\end{displaymath}

Independent 1's, t(A), of a matrix A

\begin{displaymath}A= \left[ \begin{array}{ccccc}
{\bf\underline{1}}&1&0&1&0\\
...
...
0&0&0&{\bf\underline{1}}&0\\
0&1&0&0&0\\
\end{array}\right]
\end{displaymath}




Isolated 1's of a matrix A

\begin{displaymath}A=\left[\begin{array}{cccc}
0&{\bf\underline{1}}&1&1\\
{\bf\underline{1}}&0&1&1\\
1&1&0&1\\
1&1&1&0\\
\end{array}\right]\end{displaymath}




2001-05-08