The bondage number in complete t-partite digraphs

Authors:
Xindong Zhang;Juan Liu;Jixiang Meng
Affiliations:
College of Maths-Physics and Information Sciences, Xinjiang Normal University, Urumqi, Xinjiang 830054, PR China;College of Maths-Physics and Information Sciences, Xinjiang Normal University, Urumqi, Xinjiang 830054, PR China and College of Mathematics and System Sciences, Xinjiang University, Urumqi, Xinjia ...;College of Mathematics and System Sciences, Xinjiang University, Urumqi, Xinjiang 830046, PR China
Venue:
Information Processing Letters
Year:
2009

Citing 4
Cited 0

The bondage number of a graph

Discrete Mathematics - Topics on domination
The total domination and total bondage numbers of extended de Bruijn and Kautz digraphs

Computers & Mathematics with Applications
The bondage numbers of extended de Bruijn and Kautz digraphs

Computers & Mathematics with Applications
Digraphs: Theory, Algorithms and Applications

Digraphs: Theory, Algorithms and Applications

Quantified Score

Hi-index	0.89

Visualization

Abstract

The bondage number of a digraph D is the minimum number of arcs whose removal results in a new digraph with larger domination number. In this paper, we determine the bondage number in complete t-partite digraph K-(n"1,n"2,...,n"t).