%0 Journal Article
%T On the double bondage number of graphs products
%J Transactions on Combinatorics
%I University of Isfahan
%Z 2251-8657
%A Maimani, Hamidreza
%A Koushki, Zeinab
%D 2019
%\ 03/01/2019
%V 8
%N 1
%P 51-59
%! On the double bondage number of graphs products
%K bondage number
%K double domination
%K double bondage number
%R 10.22108/toc.2018.114111.1605
%X 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.
%U https://toc.ui.ac.ir/article_23167_c10b003a8aa01309879f4e72bf73d795.pdf