Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
9512165 | Discrete Mathematics | 2005 | 7 Pages |
Abstract
The bondage number b(G) of a graph G is the cardinality of a smallest set of edges whose removal from G results in a graph with a domination number greater than the domination number of G. In this paper, we show that the bondage number of the Cartesian product CnÃC4 of two cycles Cn(n⩾4) and C4 is equal to 4, i.e., b(CnÃC4)=4 for any n⩾4.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Liying Kang, Moo Young Sohn, Hye Kyung Kim,