|
|
|
|
On the double bondage number of graphs products
|
|
|
|
|
|
|
|
نویسنده
|
koushki zeinab ,maimani hamidreza
|
|
منبع
|
transactions on combinatorics - 2019 - دوره : 8 - شماره : 1 - صفحه:51 -59
|
|
چکیده
|
A set d of vertices of graph g is called double dominating set if for any vertex v, |n[v]∩d|≥2. the minimum cardinality of double domination of g is denoted by γd(g). the minimum number of edges e′ such that γd(g∖e)>γd(g) is called the double bondage number of g and is denoted by bd(g). this paper determines that bd(g∨h) and exact values of b(pn×p2), and generalized corona product of graphs.keywords
|
|
کلیدواژه
|
bondage number double domination double bondage number
|
|
آدرس
|
islamic azad university(iau), science and research branch, department of mathematics, Iran, shahid rajaee teacher training university, department of mathematics, Iran
|
|
پست الکترونیکی
|
maimani@ipm.ir
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Authors
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|