Title of article
Weak reconstruction of strong product graphs Original Research Article
Author/Authors
Bla? Zmazek، نويسنده , , Simon Spacapan and Janez Zerovnik، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2007
Pages
9
From page
641
To page
649
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
Reconstruction problem , Strong product , Composite graphs , Graph
Journal title
Discrete Mathematics
Serial Year
2007
Journal title
Discrete Mathematics
Record number
947715
Link To Document