PASCAL - Pattern Analysis, Statistical Modelling and Computational Learning

Weak reconstruction of strong product graphs
Blaž Zmazek and Janez Žerovnik
Discrete Mathematics Volume 307, Number 3-5, pp. 641-649, 2007. ISSN 0012-365X


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.

EPrint Type:Article
Project Keyword:Project Keyword UNSPECIFIED
Subjects:Theory & Algorithms
ID Code:3726
Deposited By:Igor Pesek
Deposited On:15 February 2008