A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
On the computational complexity of upper fractional domination
1990
Discrete Applied Mathematics
This paper studies a nondiscrete generalization of T(G), the maximum cardinality of a minimal dominating set in a graph G = (K:E). In particular, a real-valued the sum of the values assigned to the vertices in the closed neighborhood of u, N[o], is at least one, i.e., f (N[u]) 2 1. The weight of a dominating function f is f (V), the sum of all values f (u) for u E V, and T,(G) is the maximum weight over all minimal dominating functions. In this paper we show that: (1) Tf(G) is computable and is
doi:10.1016/0166-218x(90)90065-k
fatcat:colnl4yxejewtj32bgtdvkix7e