R. Vasuki [1] proved fixed point theorems for expansive mappings in Menger spaces. R. Gujetiya and et al [2] presented an extension of the main result of Vasuki, for four expansive mappings in Menger space. In this article, an important lemma is given to prove that the iteration sequence is Cauchy under suitable condition in Menger probabilistic G-metric space (shortly, MPGM-space). And then, used to obtain three common fixed point theorems for expansive type mappings.

Czerwi’nski et al. introduced Lucky labeling in 2009 and Akbari et al and A.Nellai Murugan et al studied it further. Czerwi’nski defined Lucky Number of graph as follows: A labeling of vertices of a graph G is called a Lucky labeling if  for every pair of adjacent vertices u and v in G where . A graph G may admit any number of lucky labelings. The least integer k for which a graph G has a lucky labeling from the set 1, 2, k is the lucky number of G denoted by η(G). This paper aims to determine the lucky number of Complete graph K_n, Complete bipartite graph K_m,n and Complete tripartite graph K_l,m,n. It has also been studied how the lucky number changes whi

This article will introduce a new iteration method called the zenali iteration method for the approximation of fixed points. We show that our iteration process is faster than the current leading iterations  like Mann, Ishikawa, oor, D- iterations, and *-  iteration for new contraction mappings called  quasi contraction mappings. And we  proved that all these iterations (Mann, Ishikawa, oor, D- iterations and *-  iteration) equivalent to approximate fixed points of  quasi contraction. We support our analytic proof by a numerical example, data dependence result for contraction mappings type  by employing zenali iteration also discussed.

The structure of this paper includes an introduction to the definition of the nano topological space, which was defined by M. L. Thivagar, who defined the lower approximation of G and the upper approximation of G, as well as defined the boundary region of G and some other important definitions that were mentioned in this paper with giving some theories on this subject. Some examples of defining nano perfect mappings are presented along with some basic theories. Also, some basic definitions were presented that form the focus of this paper, including the definition of nano  pseudometrizable space, the definition of nano compactly generated space, and the definition of completely nano para-compact. In this paper, we presented images of nan

Among a variety of approaches introduced in the literature to establish duality theory, Fenchel duality was of great importance in convex analysis and optimization. In this paper we establish some conditions to obtain classical strong Fenchel duality for evenly convex optimization problems defined in infinite dimensional spaces. The objective function of the primal problem is a family of (possible) infinite even convex functions. The strong duality conditions we present are based on the consideration of the epigraphs of the c-conjugate of the dual objective functions and the ε-c-subdifferential of the primal objective functions.

In this paper we define and study new concepts of fibrewise topological spaces over B namely, fibrewise closure topological spaces, fibrewise wake topological spaces, fibrewise strong topological spaces over B. Also, we introduce the concepts of fibrewise w-closed (resp., w-coclosed, w-biclosed) and w-open (resp., w-coopen, w-biopen) topological spaces over B; Furthermore we state and prove several Propositions concerning with these concepts.

In this paper we define and study new concepts of functions on fibrewise  topological spaces  over  B namely,  fibrewise  weakly  (resp., closure, strongly) continuoac; funttions which are analogous of weakly

(resp., closure,   strongly)   continuous  functions   and  the  main  result is   : Let  <p       : XY  be a fibrewise  closure  (resp.,  weakly,  closure, strongly,  strongly) continuous function,  where  Y  is fibrewise topological  space  over  B and  X  is  a  fibrewise set  which  has  the

in

Consider a simple graph   on vertices and edges together with a total  labeling . Then ρ is called total edge irregular labeling if there exists a one-to-one correspondence, say  defined by  for all  where  Also, the value  is said to be the edge weight of . The total edge irregularity strength of the graph G is indicated by  and is the least  for which G admits   edge irregular h-labeling.  In this article,   for some common graph families are examined. In addition, an open problem is solved affirmatively.