Vertex connectivity of the power graph of a finite cyclic group

Abstract: Let

n = p_{1}^{n_{1}} p_{2}^{n_{2}} l d o t s p_{r}^{n_{r}}

, where

r, n_{1}, l d o t s, n_{r}

are positive integers and

p_{1}, p_{2}, l d o t s, p_{r}

are distinct prime numbers with

p_{1} < p_{2} < c d o t s < p_{r}

. For the cyclic group

C_{n}

of order

n

, let

m a t h c a l P (C_{n})

be the power graph of

C_{n}

and

k a p p a (m a t h c a l P (C_{n}))

be the vertex connectivity of

m a t h c a l P (C_{n})

. It is known that

k a p p a (m a t h c a l P (C_{n})) = p_{1}^{n_{1}} - 1

if

r = 1

. For

r g e q 2

, we determine the exact value of

k a p p a (m a t h c a l P (C_{n}))

when

2 p h i (p_{1} l d o t s p_{r - 1}) g e q p_{1} l d o t s p_{r - 1}

, and give an upper bound for

k a p p a (m a t h c a l P (C_{n}))

when

2 p h i (p_{1} l d o t s p_{r - 1}) < p_{1} l d o t s p_{r - 1}

, which is sharp for many values of

n

but equality need not hold always.

Recommendations

Cites work

Cited in

(16)

This page was built for publication: Vertex connectivity of the power graph of a finite cyclic group