The concepts of pseudo-Boolean matrix multiplication and pseudo-Boolean matrix adjoint are reviewed. For a given symmetric matrix

to be realizable as the terminal capacity matrix of an unoriented communication net, it is necessary and sufficient for

to be idempotent with respect to multiplication. Another equivalent condition is for

to be self-adjoint.