On distance-balanced generalized Petersen graphs

Abstract: A connected graph

G

of diameter

m d i a m (G) g e e l l

is

e l l

-distance-balanced if

| W_{x y} | = | W_{y x} |

for every

x, y i n V (G)

with

d_{G} (x, y) = e l l

, where

W_{x y}

is the set of vertices of

G

that are closer to

x

than to

y

. We prove that the generalized Petersen graph

G P (n, k)

is

m d i a m (G P (n, k))

-distance-balanced provided that

n

is large enough relative to

k

. This partially solves a conjecture posed by Miklaviv{c} and v{S}parl [20]. Moreover, we determine

m d i a m (G P (n, k))

when

n

is large enough relative to

k

.

Recommendations

Cites work

This page was built for publication: On distance-balanced generalized Petersen graphs