On a reconstruction problem

This note supplements an earlier paper of this author, in which the concept of a strong k-hypomorphism between two graphs was defined (, Sectin VI). For k=1, this is just a hypomorphism. Here it is proved that strongly k-hypomorphic graphs and strongly k-edge hypomorphic directed graphs are isomorphic if k>1.