| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4649087 | Discrete Mathematics | 2007 | 9 Pages |
Abstract
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.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Blaž Zmazek, Janez Žerovnik,