We study the parameterized complexity of domination-type problems. (σ, ρ)-domination is a general and unifying framework introduced by Telle: a set D of vertices of a graph G is (σ, ρ)dominating if for any v ∈ D, |N(v) ∩ D| ∈ σ and for any v / ∈ D, |N(v) ∩ D| ∈ ρ. We mainly show that for any σ and ρ the problem of (σ, ρ)-domination is W[2] when parameterized by the size of the dominating set. T...

Let Y be a subset of real numbers. A Y dominating function of a graph G = (V, E) is a function f : V → Y such that u∈NG[v] f(u) ≥ 1 for all vertices v ∈ V , where NG[v] = {v} ∪ {u|(u, v) ∈ E}. Let f(S) = u∈S f(u) for any subset S of V and let f(V ) be the weight of f . The Y -domination problem is to find a Y -dominating function of minimum weight for a graph. In this paper, we study the variat...

Decision making in the presence of multiple and conflicting objectives requires preference from the decision maker. The decision maker’s preferences give rise to a domination structure. Till now, most of the research has been focussed on the standard domination structure based on the Pareto-domination principle. However, various real world applications like medical image registration, financial...

BACKGROUND We estimated the chronic rejection of kidney transplant using an eternal Weibull regression. METHODS In this historical cohort study, we enrolled all patients with chronic renal failure who were admitted to Shahid Labbafinejad medical center (Tehran, Iran) from 1984 to 2003. Using Matlab 7.0, we considered the eternal proportion theta, as a logistic-type function of the covariates ...

A paired dominating set $P$ is a with the additional property that has perfect matching. While maximum cardainality of minimal in graph $G$ called upper domination number $G$, denoted by $\Gamma(G)$, cardinality $\Gamma_{pr}(G)$. By Henning and Pradhan (2019), we know $\Gamma_{pr}(G)\leq 2\Gamma(G)$ for any without isolated vertices. We focus on graphs satisfying equality $\Gamma_{pr}(G)= 2\Gam...