J. Korean Math. Soc. 2007; 44(6): 1213-1231
Printed November 1, 2007
https://doi.org/10.4134/JKMS.2007.44.6.121
Copyright © The Korean Mathematical Society.
Moo Young Sohn, Yuan Xudong, and Hyeon Seok Jeong
Changwon National University, Guangxi Normal University, Changwon National University
The domination number $\gamma(G)$ of a graph $G = (V, E)$ is the minimum cardinality of a subset of $V$ such that every vertex is either in the set or is adjacent to some vertex in the set. The bondage number of $b(G)$ of a graph $G$ is the cardinality of a smallest set of edges whose removal from $G$ results in a graph with domination number greater than $\gamma(G)$. In this paper, we calculate the bondage number of the Cartesian product of cycles $C_3$ and $C_n$ for all $n $.
Keywords: graph, domination number, bondage number
MSC numbers: 05C50, 05C69
2021; 58(3): 703-722
1998; 35(4): 843-853
2001; 38(5): 1069-1105
2002; 39(2): 205-219
© 2022. The Korean Mathematical Society. Powered by INFOrang Co., Ltd