In the mathematical field of graph theory, the bondage number of a nonempty graph G is the cardinality of the smallest set of edges whose removal results in a domination number strictly greater than the domination number γ(G) of G. The bondage number is denoted b(G). The concept was introduced by Fink et al.
In the mathematical field of graph theory, the bondage number of a nonempty graph G is the cardinality of the smallest set of edges whose removal results in a domination number strictly greater than the domination number γ(G) of G. The bondage number is denoted b(G). The concept was introduced by Fink et al.
Source: Wikipedia "Bondage number" · CC BY-SA 4.0
Share this article: X · Bluesky