For a positive integer k, a total {k}-dominating function of a graph G without isolated vertices is a function f from the vertex set V (G) to the set {0, 1, 2, . . . , k} such that for any vertex v ∈ V (G), the condition ∑ u∈N(v) f(u) ≥ k is fulfilled, where N(v) is the open neighborhood of v. The weight of a total {k}-dominating function f is the value ω(f) = ∑ v∈V f(v). The total {k}-dominati...

This report describes the state of the research and practice in the areas of metadata management systems. Open source and industrial products are presented and compared. Thereout we identified functional and non-functional requirements relevant for the TEAM project. Project co-funded by the European Commission under the “Information Society Technology” Programme, Framework Programme 6. D5: Repo...

Limited dominating broadcasts were proposed as a variant of dominating broadcasts, where the broadcast function is upper bounded. As a natural extension of domination, we consider dominating 2-broadcasts along with the associated parameter, the dominating 2-broadcast number. We prove that computing the dominating 2-broadcast number is a NP-complete problem, but can be achieved in linear time fo...

Given a graph G together with a capacity function c : V (G) → N, we call S ⊆ V (G) a capacitated dominating set if there exists a mapping f : (V (G) \ S) → S which maps every vertex in (V (G) \S) to one of its neighbors such that the total number of vertices mapped by f to any vertex v ∈ S does not exceed c(v). In the Planar Capacitated Dominating Set problem we are given a planar graph G, a ca...

In a graph G=(V,E), where every vertex is assigned 0, 1 or 2, f an assignment such that 0 has at least one neighbor 2 and all vertices labeled by are independent, then called outer independent Roman dominating function (OIRDF). The domination strengthened if 1, 3, each two neighbors double (OIDRDF). weight of (OIDRDF) OIRDF the sum f(v) for v?V. (double) number (?oidR(G)) ?oiR(G) minimum taken ...

co-channel interference is a major factor in limiting the capacity and link quality in cellular communications. as the co-channel interference is modeled by lognormal distribution, sum of the co-channel interferences of neighboring cells is represented by the sum of lognormal random variables (rvs) which has no closed-form expression. assuming independent, identically distributed (iid) rvs, the...

a new correlation function for the calculation of viscosity for five typical supercritical gases is presented using the rainwater-friend and modified enskog theory. it is shown that by using accurate value for the thermal pressure and co-volume in the modified enskog theory, this correlation function is suitable for calculation of the viscosity of supercritical gases, without any density and te...

we define minimal cn-dominating graph $mathbf {mcn}(g)$, commonality minimal cn-dominating graph $mathbf {cmcn}(g)$ and vertex minimal cn-dominating graph $mathbf {m_{v}cn}(g)$, characterizations are given for graph $g$ for which the newly defined graphs are connected. further serval new results are developed relating to these graphs.

An edge dominating set of a graph is said to be an odd (even) sum degree (osded (esded) - set) G if the all edges in X number. The domination number minimum cardinality taken over sets and defined as zero no such exists G. In this paper, concept extended on co-dominating E-T G, where T corresponding parameters co-odd set, value defined. Further, exact values above are found for some standard cl...

We generalize some results of Ford and Roman constraining the possible behaviors of the renormalized expected stressenergy tensor of a free massless scalar field in two dimensional Minkowski spacetime. Ford and Roman showed that the energy density measured by an inertial observer, when averaged with respect to the observers proper time by integrating against some weighting function, is bounded ...