Bondage number of the strong product of two trees

摘要

Abstract The bondage number b ( G ) of a nonempty graph G is the cardinality of a minimum set of edges whose removal from G results in a graph with domination number greater than that of G . It is known that b ( T ) ≤ 2 for any nontrivial tree