.png){kind=icon}
.png){kind=icon}
Return
Double domination in some graph operators
.png){kind=icon}
PRE
AI
DOI：10.2298/FIL2602693C.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Let G be a nontrivial graph. A set D subset of V(G) is a double dominating set of G if |N_G[v] boolean AND D| >= 2 for every vertex v is an element of V(G), where N_G[v] represents the closed neighborhood of v. The double domination number of G is the minimum cardinality among all double dominating sets of G. In this paper we study this domination parameter in some well-known graph operators defined from a connected graph G.
Keywords:
Double domination
Total Italian domination
Graph operators