Weak reconstruction of strong product graphs

We prove that the class of nontrivial connected strong product graphs is weakly reconstructible. We also show that any nontrivial connected thin strong product graph can be uniquely reconstructed from each of its one-vertex-deleted deleted subgraphs.