Trees with maximum p-reinforcement number

Abstract: Let

G = (V, E)

be a graph and

p

a positive integer. The

p

-domination number

g_{p} (G)

is the minimum cardinality of a set

D s u b s e t e q V

with

| N_{G} (x) c a p D | g e q p

for all

x i n V s e t m i n u s D

. The

p

-reinforcement number

r_{p} (G)

is the smallest number of edges whose addition to

G

results in a graph

G^{'}

with

g_{p} (G^{'}) < g_{p} (G)

. Recently, it was proved by Lu et al. that

r_{p} (T) l e q p + 1

for a tree

T

and

p g e q 2

. In this paper, we characterize all trees attaining this upper bound for

p g e q 3

.

Recommendations

Cites Work

Cited In (5)

This page was built for publication: Trees with maximum \(p\)-reinforcement number