Abstract
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 edges whose removal enlarges the total domination number, measures to some extent the robustness of a network where a minimum total dominating set is required. 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 Gonda in 1995, which generalize the classical de Bruijn digraph and the Kautz digraph.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 1206-1213 |
| Number of pages | 8 |
| Journal | Computers and Mathematics with Applications |
| Volume | 53 |
| Issue number | 8 |
| DOIs | |
| State | Published - Apr 2007 |
| Externally published | Yes |
Keywords
- Extended Kautz digraph
- Extended de Burijn digraph
- Minimum total dominating set
- Total bondage number
- Total domination
ASJC Scopus subject areas
- Modeling and Simulation
- Computational Theory and Mathematics
- Computational Mathematics