J. Dunbar

We say that a function f : V → {0, 1, ..., diam(G)} is a broadcast if for every vertex v ∈ V, f(v) ≤ e(v). Expand

A dominating set D is a weakly connected dominating set of a connected graph G if (V,E@?(DxV)) is connected. Expand

We investigate graphs which satisfy the upper bound for the minimum cardinality of the dominating set of a graph G with n vertices. Expand

We introduce one of many classes of problems which can be defined in terms of 3-valued functions on the vertices of a graph G of the form |:V → {−1,0,1}. Expand

We define n p ( G ) to be the minimum cardinality of a 1-minimal nearly perfect set, and N p (G) to be a maximum cardinality. Expand

A three-valued function f defined on the vertices of a graph G = (V, E), f : V → {−1, 0, 1}, is a minus dominating function if the sum of its function values over any closed neighborhood is at least one. Expand

A three-valued function f defined on the vertices of a graph G = ( V , E ), f : V → {−1, 0, 1}, is a minus dominating function if the sum of its function values over any closed neighborhood is at least one. Expand