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 ...
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.
We determine the total domination number and total bondage number of the extended de Burijn digraph and the extended Kautz digraph, proposed by Shibata and ...
In this paper we consider the total domination number and the total bondage number for digraphs. The total bondage number, defined as the minimum number of ...
We determine the total domination number and total bondage number of the extended de Burijn digraph and the extended Kautz digraph, proposed by Shibata and ...
Dive into the research topics of 'The bondage numbers of extended de Bruijn and Kautz digraphs'. Together they form a unique fingerprint. Sort by; Weight ...
Dec 6, 2016 · In this paper, we determine the power domination numbers of de Bruijn and Kautz digraphs. Subjects: Discrete Mathematics (cs.DM); Combinatorics ...
Missing: bondage extended
Oct 22, 2024 · This work deals with the domination numbers of generalized de Bruijn digraphs and generalized Kautz digraphs. Dominating sets for digraphs ...
We determine the total domination number and total bondage number of the extended de Burijn digraph and the extended Kautz digraph, proposed by Shibata and ...
... the bondage number of a graph. Discrete. Math. 128 (1994) 173-177. [12] J. Huang, J.-M. Xu, The bondage numbers of extended de Bruijn and Kautz digraphs, Comput ...