On the double bondage number of graphs products
Publish place: Transactions on Combinatorics، Vol: 8، Issue: 1
Publish Year: 1398
نوع سند: مقاله ژورنالی
زبان: English
View: 157
This Paper With 9 Page And PDF Format Ready To Download
- Certificate
- من نویسنده این مقاله هستم
استخراج به نرم افزارهای پژوهشی:
شناسه ملی سند علمی:
JR_COMB-8-1_004
تاریخ نمایه سازی: 14 اردیبهشت 1400
Abstract:
A set $D$ of vertices of graph $G$ is called $double$ $dominating$ $set$ if for any vertex $v$, $|N[v]\cap D|\geq ۲$. 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_۲)$, and generalized corona product of graphs.
Keywords:
Authors
Zeinab Koushki
Mathematics, research and science, tehran