期刊
COMPUTERS & MATHEMATICS WITH APPLICATIONS
卷 51, 期 6-7, 页码 1137-1147出版社
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.camwa.2005.10.015
关键词
domination; de Bruijn digraph; Kautz digraph; extended de Bruijn digraph; bondage number; extended Kautz digraph
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 deBruijn 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 <= b(B(d, n)) <= 2d if n is even, and b(K(d, n)) = d + 1. (C) 2006 Elsevier Ltd. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据