20.500.12556/DKUM-58152 Covering codes in Sierpiński graphs Pokrivne kode v grafih Sierpińskega Za dani graf ▫$G$▫ in celi števili ▫$a$▫ in ▫$b$▫ je ▫$(a,b)$▫-koda grafa ▫$G$▫ množica vozlišč ▫$C$▫, tako da ima vsako vozlišče iz ▫$C$▫ natanko ▫$a$▫ sosedov v ▫$C$▫, vsako drugo vozlišče pa natanko ▫$b$▫ sosedov v ▫$C$▫. V tem prispevku klasificiramo števila ▫$a$▫ in ▫$b$▫, za katera obstajajo ▫$(a,b)$▫-kode v grafih Sierpińskega. For a graph ▫$G$▫ and integers ▫$a$▫ and ▫$b$▫, an ▫$(a,b)$▫-code of ▫$G$▫ is a set ▫$C$▫ of vertices such that any vertex from ▫$C$▫ has exactly ▫$a$▫ neighbors in ▫$C$▫ and any vertex not in ▫$C$▫ has exactly ▫$b$▫ neighbors in ▫$C$▫. In this paper we classify integers ▫$a$▫ and ▫$b$▫ for which there exists ▫$(a,b)$▫-codes in Sierpiński graphs. graph theory codes in graphs perfect codes Sierpiński graphs teorija grafov kode v grafih popolne kode grafi Sierpińskega true true true Discrete Mathematics & Theoretical Computer Science Angleški jezik Slovenski jezik Znanstveno delo 2016-04-08 16:45:48 2017-07-10 11:05:03 2025-09-16 12:27:19 2019-07-11 10:30:11 2010 0 0 Str. 63-74 št. 3 Letn. 12 2010 0000-00-00 Zaloznikova Objavljeno NiDoloceno 0000-00-00 2009-02-04 2010-05-14 1365-8050 519.17 8089433 15649881 1365-8050 URN:SI:UM:DK:SCFSE74F Discrete_Mathematics_&_Theoretical_Computer_Science_2014_Beaudou_et_al._Covering_codes_in_Sierpinski_graphs.pdf Discrete_Mathematics_&_Theoretical_Computer_Science_2014_Beaudou_et_al._Covering_codes_in_Sierpinski_graphs.pdf 1 1266964E10E6571C792B1AD4E0AF36D6 adf8c945d74af4eddfe77411b639f6efc6b5308ea83932679b443247eaa4bc00 63254b8a-7c0e-11eb-bb7a-00155d0001ca https://dk.um.si/Dokument.php?lang=slv&id=113943 http://dmtcs.episciences.org/508 1 https://dk.um.si/Dokument.php?lang=slv&id=88233 Fakulteta za naravoslovje in matematiko 0 0 0