论文信息 - The total domination and total bondage numbers of extended de Bruijn and Kautz digraphs

The total domination and total bondage numbers of extended de Bruijn and Kautz digraphs

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.

Jun-Ming Xu | Jia Huang

[1] N. Sridharan. Total Bondage Number of a Graph , 2007 .

[2] S. Hedetniemi,et al. Domination in graphs : advanced topics , 1998 .

[3] Michael S. Jacobson,et al. The bondage number of a graph , 1991, Discret. Math..

[4] Jun-Ming Xu,et al. The bondage numbers of extended de Bruijn and Kautz digraphs , 2006, Comput. Math. Appl..

[5] Stephen T. Hedetniemi,et al. Total domination in graphs , 1980, Networks.

[6] Dhiraj K. Pradhan,et al. Fault-Tolerant VLSI Architectures Based on de Bruijn Graphs (Galileo in the Mid Nineties) , 1989, Reliability Of Computer And Communication Networks.

[7] Yukio Shibata,et al. Extension of de Bruijn graph and Kautz graph , 1995 .

[8] Junming Xu. Topological Structure and Analysis of Interconnection Networks , 2002, Network Theory and Applications.

[9] Peter J. Slater,et al. Fundamentals of domination in graphs , 1998, Pure and applied mathematics.

[10] Béla Bollobás. Advances in graph theory , 1978 .