Mathematics, Volume 6, Issue 11

The vertex k-partiteness of graph G is defined as the fewest number of vertices whose deletion from G yields a k-partite graph. In this paper, we characterize the extremal value of the reformulated first Zagreb index, the multiplicative-sum Zagreb in...

There is a fairly widespread belief that the problem of existence is not an essential issue for logic. Logic, though formal, must deal with the problem of existence. However, logic should be limited to describing “formal existence” or &ld...

In 1978, the domain of the Nörlund matrix on the classical sequence spaces lp and l∞ was introduced by Wang, where 1 ≤ p < ∞. Tuğ and Başar studied the matrix domain of Nörlund mean on the sequence spaces f0 and f in 2016....

The identification of a reduced dimensional representation of the data is among the main issues of exploratory multidimensional data analysis and several solutions had been proposed in the literature according to the method. Principal Component Analy...

In this article, a methodology is developed to solve an interval and a fractional interval programming problem by converting into a non-interval form for second order cone constraints, with the objective function and constraints being interval valued...

Background: People want to be able to evaluate different kinds of information in a good way. There are various methods that they develop in such situations. Among the optimization methods, the goal programming method is often used when there are mult...

Let g be an analytic function with the normalization in the open unit disk. Let L ( r ) be the length of g ( { z : | z | = r } ) . In this paper we present a correspondence between g and L ( r ) for the case when g is not neces...

In this paper, we introduce the concepts of an α -admissible nonself-mapping, an α -F-contractive nonself-mapping, a weak α -F-contractive nonself-mapping, and a generalized α -F-contractive nonself-mapping...

In this paper, we introduce the notion of ( α , β , ψ ) -contraction for a pair of mappings ( S , T ) defined on a set X. We use our new notion to create and prove a common fixed point theorem for two mappings defined on...

In this paper, we introduce a new concept of random α -proximal admissible and random α - Z -contraction. Then we establish random best proximity point theorems for such mapping in complete separable metric spaces.