On the weak reconstruction of strong product graphsZmazek, Blaž (Avtor) Žerovnik, Janez (Avtor) matematikateorija grafovproblem rekonstrukciješibka rekonstrukcijakrepki produkt grafovmathematicsgraph theoryreconstruction problemstrong productcomposite graphsWe prove that any nontrivial connected strong product graph can be uniquely reconstructed from each of its one vertex deleted subgraphs.20032015-07-10 14:52:43Članek v reviji51510UDK: 519.17OceCobissID: 13803097COBISS_ID: 13825625ISSN pri članku: 1571-0653NUK URN: URN:SI:UM:DK:YKNMVZQ1sl