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.
2009
2013-10-15 12:06:32
1033
graph, strongy distance-balanced, generalized Petersen graph
teorija grafov, graf, krepko razdaljno uravnotežen, posplošeni Petersenov graf
Klavdija
Kutnar
70
Aleksander
Malnič
70
Dragan
Marušič
70
Štefko
Miklavič
70
UDK
4
519.17
ISSN pri članku
9
1855-3966
COBISS.SI-ID
3
1024077396
0
Predstavitvena datoteka
2013-10-15 12:06:32
RAZ_Kutnar_Klavdija_i2009.pdf
149738
Predstavitvena datoteka
2021-12-30 21:40:55