0 KB146 KB14 KB200820252009Kutnar, KlavdijaMalnič, AleksanderMarušič, DraganMiklavič, Štefkoštevilka:1letnik:2str. 41-47COBISSID:1024077396ISSN:1855-3966URN:URN:NBN:SI:doc-ALT9RRPZenDruštvo matematikov, fizikov in astronomov SlovenijeArs mathematica contemporaneagrafiteorija grafovThe strongly distance-balanced property og 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-balancedTEXTznanstveno časopisjejournalsSlovenian National E-content AggregatorNational and University Library of SloveniaUniverza na Primorskem, Fakulteta za naravoslovje, matematiko in informacijske tehnologije