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

Naturally occurring diagrams in algebraic topology are commutative up to homotopy, but not on the nose. It was quickly realized that very little can be done with this information. Homotopy coherent category theory arose out of a desire to catalog the higher homotopical information required to restore constructibility (or more precisely, functoriality) in such “up to homotopy” settings. The firs...

in this article, we demonstrate an analytic-numeric solution for some dynamical systems using the multistagehomotopy perturbation method. the method yields results that are in complete agreement with their numericalcounterparts.

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

A functor is constructed from the category of globular CW-complexes to that of flows. It allows the comparison of the S-homotopy equivalences (resp. the T-homotopy equivalences) of globular complexes with the S-homotopy equivalences (resp. the T-homotopy equivalences) of flows. Moreover, it is proved that this functor induces an equivalence of categories from the localization of the category of...

Homotopy type theory is a recent research area connecting type theory with homotopy theory by interpreting types as spaces. In particular, one can prove and mechanize type-theoretic analogues of homotopy-theoretic theorems, yielding “synthetic homotopy theory”. Here we consider the Seifert–van Kampen theorem, which characterizes the loop structure of spaces obtained by gluing. This is useful in...

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

We calculate the homotopy groups of K(S) in terms of the homotopy groups of K(Z), the homotopy groups of CP∞ −1, and the homotopy groups of S. This completes the program begun by Waldhausen, who computed the rational homotopy groups (building on work of Quillen and Borel), and continued by Rognes, who calculated the groups at regular primes in terms of the homotopy groups of CP∞ −1, and the hom...

Here, a new method called Aboodh transform homotopy perturbation method(ATHPM) is used to solve nonlinear partial dierential equations, we presenta reliable combination of homotopy perturbation method and Aboodh transformto investigate some nonlinear partial dierential equations. The nonlinearterms can be handled by the use of homotopy perturbation method. The resultsshow the eciency of this me...