In this paper, we show that for the alternating group An, the class C of n- cycle, CC covers An for n when n = 4k + 1 > 5 and odd. This class splits into two classes of An denoted by C and C/, CC= C/C/ was found.

      Throughout this paper, a generic iteration algorithm for a finite family of total asymptotically quasi-nonexpansive maps in uniformly convex Banach space is suggested. As well as weak / strong convergence theorems of this algorithm to a common fixed point are established. Finally, illustrative numerical example by using Matlab is presented.

In this article, the partially ordered relation is constructed in geodesic spaces by betweeness property, A monotone sequence is generated in the domain of monotone inward mapping,  a monotone inward contraction mapping is a  monotone Caristi inward mapping is proved, the general fixed points for such mapping is discussed and A mutlivalued version of these results is also introduced.

      Some cases of common fixed point theory for classes of generalized nonexpansive maps are studied. Also, we show that the Picard-Mann scheme can be employed to approximate the unique solution of a mixed-type Volterra-Fredholm functional nonlinear integral equation.

The purpose of this paper is to introduce and prove some coupled coincidence fixed point theorems for self mappings satisfying -contractive condition with rational expressions on complete partially ordered metric spaces involving altering distance functions with mixed monotone property of the mapping. Our results improve and unify a multitude of coupled fixed point theorems and generalize some recent results in partially ordered metric space. An example is given to show the validity of our main result. 

This paper discusses the limitation of both Sequence Covering Array (SCA) and Covering Array (CA) for testing reactive system when the order of parameter-values is sensitive. In doing so, this paper proposes a new model to take the sequence values into consideration. Accordingly, by superimposing the CA onto SCA yields another type of combinatorial test suite termed Multi-Valued Sequence Covering Array (MVSCA) in a more generalized form. This superimposing is a challenging process due to NP-Hardness for both SCA and CA. Motivated by such a challenge, this paper presents the MVSCA with a working illustrative example to show the similarities and differences among combinatorial testing methods. Consequently, the MVSCA is a

     In today's world, digital image storage and transmission play an essential role,where images are mainly involved in data transfer. Digital images usually take large storage space and bandwidth for transmission, so image compression is important in data communication. This paper discusses a unique and novel lossy image compression approach. Exactly 50% of image pixels are encoded, and other 50% pixels are excluded. The method uses a block approach. Pixels of the block are transformed with a novel transform. Pixel nibbles are mapped as a single bit in a transform table generating more zeros, which helps achieve compression. Later, inverse transform is applied in reconstruction, and a single bit value from the table is rem

The paper aims at initiating and exploring the concept of extended metric known as the Strong Altering JS-metric, a stronger version of the Altering JS-metric. The interrelation of Strong Altering JS-metric with the b-metric and dislocated metric has been analyzed and some examples have been provided. Certain theorems on fixed points for expansive self-mappings in the setting of complete Strong Altering JS-metric space have also been discussed.