20.500.12556/RUP-1901 The strongly distance-balanced property of the generalized Petersen graphs A graph ▫$X$▫ is said to be strongly distance-balanced whenever for any edge ▫$uv$▫ of ▫$X$▫ and any positive integer ▫$i$▫, the number of vertices at distance ▫$i$▫ from ▫$u$▫ and at distance ▫$i + 1$▫ from ▫$v$▫ is equal to the number of vertices at distance ▫$i + 1$▫ from ▫$u$▫ and at distance ▫$i$▫ from ▫$v$▫. It is proven that for any integers ▫$k \ge 2$▫ and ▫$n \ge k^2 + 4k + 1$▫, the generalized Petersen graph GP▫$(n, k)$▫ is not strongly distance-balanced. graph strongy distance-balanced generalized Petersen graph teorija grafov graf krepko razdaljno uravnotežen posplošeni Petersenov graf true true false Angleški jezik Angleški jezik Neznano 2013-10-15 12:06:32 2013-10-15 12:06:32 2024-03-01 12:02:22 0000-00-00 00:00:00 2009 0 0 str. 41-47 no. 1 Vol. 2 2009 0000-00-00 NiDoloceno NiDoloceno NiDoloceno 0000-00-00 0000-00-00 0000-00-00 519.17 1855-3966 1024077396 RAZ_Kutnar_Klavdija_i2009.pdf RAZ_Kutnar_Klavdija_i2009.pdf 1 873B81253895F0858428F04662DFD4E7 b67fb3691478c6bafd192f40125ff6374164f41b1a07f7c75c69ed04afe0bada 768ab9e3-c3d6-11ed-b5df-005056bf369b https://repozitorij.upr.si/Dokument.php?lang=slv&id=25901 Založba Univerze na Primorskem 0 0 0