The aim of the present study was to examine physical fitness differences between Freestyle and Greco-Roman junior wrestlers. One hundred twenty-six junior wrestlers, comprising 70 Freestyle and 56 Greco-Roman wrestlers, participated in this study. The somatic and physical fitness profile included body mass, body height, body mass index, body composition, flexibility, maximal anaerobic power of ...

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...

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 ...

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.

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 ...

We consider two infinite games, played on a countable graph G given with an integer vertex labelling. One player seeks to construct a ray (a one-way infinite path) in G, so that the ray’s labels dominate or elude domination by an integer sequence being constructed by another player. For each game, we give a structural characterization of the graphs on which one player or the other can win, prov...

Let G = (V,E) be a graph. A subset S of V is called a dominating set if each vertex of V −S has at least one neighbor in S. The domination number γ(G) equals the minimum cardinality of a dominating set in G. A minus dominating function on G is a function f : V → {−1, 0, 1} such that f(N [v]) = ∑ u∈N [v] f(u) ≥ 1 for each v ∈ V , where N [v] is the closed neighborhood of v. The minus domination ...

Let $G$ be a graph with vertex set $V(G)$. For any integer $kge 1$, a signed (total) $k$-dominating functionis a function $f: V(G) rightarrow { -1, 1}$ satisfying $sum_{xin N[v]}f(x)ge k$ ($sum_{xin N(v)}f(x)ge k$)for every $vin V(G)$, where $N(v)$ is the neighborhood of $v$ and $N[v]=N(v)cup{v}$. The minimum of the values$sum_{vin V(G)}f(v)$, taken over all signed (total) $k$-dominating functi...