| 0 | 1 | 1 | 0 | 0 | 0 |
| 1 | 0 | 0 | 1 | 0 | 0 |
| 1 | 0 | 0 | 1 | 1 | 0 |
| 0 | 1 | 1 | 0 | 0 | 1 |
| 0 | 0 | 1 | 0 | 0 | 1 |
| 0 | 0 | 0 | 1 | 1 | 0 |
A Steinhaus graph is a special type of undirected graph that is easily represented and computed using an adjacency matrix (1 if adjacent, 0 if not). In the matrix, every place along the diagonal starting at (0,0) down to (n,n) contains a 0. After the first row is given in binary notation, the remaining cells of the matrix may computed using the exlusive or operation. Any one location above the diagonal of zeroes can be computed by looking at the values contained in the cell directly above and the cell northwest of the point being calculated. If one of these two cells but not the other contains a 1, then the cell being computed is filled with a 1. Otherwise, when both positions have the same value, the cell being calculated is filled by a 0. Since Steinhaus graphs are undirected, they are symetric on the diagonal from 0,0 to n,n. As a result of this property, the section of the graph below the diagonal of zeros is filled in when its symetric cell above the diagonal is computed.
| 0 | 1 | 1 | 0 | 0 | 0 |
| 1 | 0 | 0 | 1 | 0 | 0 |
| 1 | 0 | 0 | 1 | 1 | 0 |
| 0 | 1 | 1 | 0 | 0 | 1 |
| 0 | 0 | 1 | 0 | 0 | 1 |
| 0 | 0 | 0 | 1 | 1 | 0 |