Paired bondage in trees

Let G=(V,E) be a graph with δ(G)≥1. A set D⊆V is a paired dominating set if D is dominating, and the induced subgraph 〈D〉 contains a perfect matching. The paired domination number of G, denoted by γ_p(G), is the minimum cardinality of a paired dominating set of G. The paired bondage number, denoted by b_p(G), is the minimum cardinality among all sets of edges E^′⊆E such that δ(G−E^′)≥1 and γ_p(G−E^′)>γ_p(G). We say that G is a γ_p-strongly stable graph if, for all E^′⊆E, either γ_p(G−E^′)=γ_p(G) or δ(G−E^′)=0. We discuss the basic properties of paired bondage and give a constructive characterization of γ_p-strongly stable trees.