Displaying similar documents to “Dominating sets and domination polynomials of paths.”

Restricted partitions and q-Pell numbers

Toufik Mansour, Mark Shattuck (2011)

Open Mathematics

Similarity:

In this paper, we provide new combinatorial interpretations for the Pell numbers p n in terms of finite set partitions. In particular, we identify six classes of partitions of size n, each avoiding a set of three classical patterns of length four, all of which have cardinality given by p n. By restricting the statistic recording the number of inversions to one of these classes, and taking it jointly with the statistic recording the number of blocks, we obtain a new polynomial generalization...

A note on rapid convergence of approximate solutions for second order periodic boundary value problems

Rahmat A. Khan, Bashir Ahmad (2005)

Archivum Mathematicum

Similarity:

In this paper, we develop a generalized quasilinearization technique for a nonlinear second order periodic boundary value problem and obtain a sequence of approximate solutions converging uniformly and quadratically to a solution of the problem. Then we improve the convergence of the sequence of approximate solutions by establishing the convergence of order k ( k ≥ 2 ) .

Spatially-distributed coverage optimization and control with limited-range interactions

Jorge Cortés, Sonia Martínez, Francesco Bullo (2005)

ESAIM: Control, Optimisation and Calculus of Variations

Similarity:

This paper presents coordination algorithms for groups of mobile agents performing deployment and coverage tasks. As an important modeling constraint, we assume that each mobile agent has a limited sensing or communication radius. Based on the geometry of Voronoi partitions and proximity graphs, we analyze a class of aggregate objective functions and propose coverage algorithms in continuous and discrete time. These algorithms have convergence guarantees and are spatially distributed...