|
|||||
|
|
Weak reconstruction of strong product graphs |
|
| Affiliation: | University of Maribor, FME, Smetanova 17, 2000 Maribor, Slovenia |
| 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: | |
| 本文献已被 ScienceDirect 等数据库收录！ | |