In this article, we deal with iterative methods for approximation of fixed points and their applications. We first discuss fixed point theorems for a nonexpansive mapping or a family of nonexpansive mappings. In particular, we state a fixed point theorem which answered affirmatively a problem posed during the Conference on Fixed Point Theory and Applications held at CIRM, Marseille-Luminy, 1989...

Background: The onset of primary progressive multiple sclerosis (PPMS) can be triggered by sun exposure and physical activity. The present study aimed to determine the risk of sun exposure and physical activity in PPMS development. Methods: The case-control study recruited PPMS cases and healthy controls from the general population from September 2019 to September 2020 in Tehran, Iran. The sel...

We derive several interesting formulae for the eigenvalues of the derangement graph and use them to settle affirmatively a conjecture of Ku regarding the least eigenvalue.

A major problem of mobile agents is their apparent inability to authenticate transactions in hostile environments. In this paper, we consider a framework for the prevention of agent tampering without compromising the mobility or autonomy of the agent. Our approach uses encrypted functions. We present an RSA implementation which answers affirmatively the open problem on undetachable signatures o...

Abstract. We answer affirmatively the special case of q = 1, n = 2, j = 2 of Question 3 on page 1004 of Alesker, Annals of Mathematics 149 (1999).

Purpose The main purpose of this research is to examine the influence macroeconomic stability on economic growth SAARC (South Asian Association for Regional Cooperation) countries. Design/methodology/approach Using panel data 1991–2020, fixed effect regression analysis, pooled ordinary least squares and generalized method moments techniques have been conducted demonstrate whether contributes gr...

In this paper we show that there exists a constant C > 0 such that for any graph G on Ck ln k vertices either G or its complement G has an induced subgraph on k vertices with minimum degree at least 2 (k− 1). This affirmatively answers a question of Erdős and Pach from 1983.

Abstract A set of vertices in a graph is dominating if every vertex or adjacent to . If, addition, an independent set, then set. The domination number the minimum cardinality , while We prove that for all integers it holds connected ‐regular graph, with equality and only result was previously known This affirmatively answers question Babikir Henning.