20.500.12556/DKUM-51510 On the weak reconstruction of strong product graphs Šibka rekonstrukcija krepkega produkta grafov We prove that any nontrivial connected strong product graph can be uniquely reconstructed from each of its one vertex deleted subgraphs. matematika teorija grafov problem rekonstrukcije šibka rekonstrukcija krepki produkt grafov mathematics graph theory reconstruction problem strong product composite graphs true true false Angleški jezik Slovenski jezik Članek v reviji 2015-07-10 14:52:43 2015-07-10 14:52:43 2024-03-05 14:48:36 2019-07-11 07:20:58 2003 0 0 str. 123-127 Vol. 13 April 2003 0000-00-00 NiDoloceno NiDoloceno NiDoloceno 0000-00-00 0000-00-00 0000-00-00 519.17 13803097 13825625 1571-0653 URN:SI:UM:DK:YKNMVZQ1 http://dx.doi.org/10.1016/S1571-0653(04)00452-4 1 https://dk.um.si/Dokument.php?lang=slv&id=76070 Pedagoška fakulteta 0 0 0