We settle two conjectures on domination-search, a game proposed by Fomin et.al. [1], one in affirmative and the other in negative. The two results presented here are (1) domination search number can be greater than domination-target number, (2) domination search number for asteroidal-triple-free graphs is at most 2.

in this paper, we give an analytical approximate solution for an integro- differential equation which describes the charged particle motion for certain configurations of oscillating magnetic fields is considered. the homotopy analysis method (ham) is used for solving this equation. several examples are given to reconfirm the efficiency of these algorithms. the results of applying this procedure...

MacGillivray and Seyffarth (J. Graph Theory 22 (1996), 213–229) proved that planar graphs of diameter three have domination number at most ten. Recently it was shown (J. Graph Theory 40 (2002), 1–25) that a planar graph of diameter three and of radius two has domination number at most six while every sufficiently large planar graph of diameter three has domination number at most seven. In this ...

We consider four different types of multiple domination and provide new improved upper bounds for the kand k-tuple domination numbers. They generalise two classical bounds for the domination number and are better than a number of known upper bounds for these two multiple domination parameters. Also, we explicitly present and systematize randomized algorithms for finding multiple dominating sets...

An exact lower bound for the domination number and the total domination number of the direct product of finitely many complete graphs is given: (×i=1Kni) ≥ t + 1, t ≥ 3. Sharpness is established in the case when the factors are large enough in comparison to the number of factors. The main result gives a lower bound for the domination (and the total domination) number of the direct product of tw...

Domination is a relation between general operations defined on a poset. The old open problem is whether domination is transitive on the set of all t-norms. In this paper we contribute partially by inspection of domination in the family of Frank and Hamacher tnorms. We show that between two different t-norms from the same family, the domination occurs iff at least one of the t-norms involved is ...

in this study, a new efficient semi-analytical method is introduced to give approximate solutions of strongly nonlinear oscillators. the proposed method is based on combination of two different methods, the multi-step homotopy analysis method and spectral method, called the multi-step spectral homotopy analysis method (msham). in this method, firstly, we propose a new spectral homotopy analysis...

We construct compatible symplectic structures on manifolds Q3 × S1 for Waldhausen Q3 and show it is possible iff Q3 is a Stallings fibrations over S1. We describe bordisms of Lagrangian T 2-bundles over S1 × I .