| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 428025 | Information Processing Letters | 2009 | 4 Pages |
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 .
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
