@article {
author = {Maimani, Hamidreza and Koushki, Zeinab},
title = {On the double bondage number of graphs products},
journal = {Transactions on Combinatorics},
volume = {8},
number = {1},
pages = {51-59},
year = {2019},
publisher = {University of Isfahan},
issn = {2251-8657},
eissn = {2251-8665},
doi = {10.22108/toc.2018.114111.1605},
abstract = {A set $D$ of vertices of graph $G$ is called $double$ $dominating$ $set$ if for any vertex $v$, $|N[v]\cap D|\geq 2$. The minimum cardinality of $double$ $domination$ of $G$ is denoted by $\gamma_d(G)$. The minimum number of edges $E'$ such that $\gamma_d(G\setminus E)>\gamma_d(G)$ is called the double bondage number of $G$ and is denoted by $b_d(G)$. This paper determines that $b_d(G\vee H)$ and exact values of $b(P_n\times P_2)$, and generalized corona product of graphs.},
keywords = {bondage number,double domination,double bondage number},
url = {https://toc.ui.ac.ir/article_23167.html},
eprint = {https://toc.ui.ac.ir/article_23167_c10b003a8aa01309879f4e72bf73d795.pdf}
}