The complexity of open k-monopolies in graphs for negative k
Let (G) be a graph with vertex set (V(G)), (delta(G)) minimum degree of (G) and (kinleft{1-leftlceilrac{delta(G)}{2} ight ceil,ldots ,leftlfloor rac{delta(G)}{2} ight floor ight}).Given Using Baidu index to nowcast hand-foot-mouth disease in China: a meta learning approach a nonempty set (Msubseteq V(G)) a vertex (v) of (G) is said to be (k)-cont