Discrete Mathematics - Topics on domination
Bounds on the bondage number of a graph
Discrete Mathematics
New results about the bondage number of a graph
Discrete Mathematics
On the domination numbers of generalized de Bruijn digraphs and generalized Kautz digraphs
Information Processing Letters
The total domination and total bondage numbers of extended de Bruijn and Kautz digraphs
Computers & Mathematics with Applications
The bondage number in complete t-partite digraphs
Information Processing Letters
The total bondage number of grid graphs
Discrete Applied Mathematics
| Hi-index | 0.09 |
In this paper, we consider the bondage number b(G) for a digraph G, which is defined as the minimum number of edges whose removal results in a new digraph with larger domination number. This parameter measures to some extent the robustness of an interconnection network with respect to link failures. By constructing a family of minimum dominating sets, we compute the bondage numbers of the extended de Bruijn digraph and the extended Kautz digraph. As special cases, we obtain for the de Bruijn digraph B(d, n) and the Kautz digraph K(d, n) that b(B(d, n)) = d if n is odd and d =