Induced mappings on $C_n(X)/{C_n}_K(X)$

Given a continuum $X$ and $n\in\mathbb{N}$. Let $C_n(X)$ be the hyperspace of all nonempty closed subsets of $X$ with at most $n$ components. Let ${C_n}_K(X)$ be the hyperspace of all elements in $C_n(X)$ containing $K$ where $K$ is a compact subset of $X$. $C^n_K(X)$ denotes the quotient space $C_n(X)/{C_n}_K(X)$. Given a mapping $f:X\to Y$ between continua, let $C_n(f):C_n(X)\to C_n(Y)$ be the induced mapping by $f$, defined by $C_n(f)(A)=f(A)$. We denote the natural induced mapping between $C^n_K(X)$ and $C^n_{f(K)}(Y)$ by $C^n_K(f)$. In this paper, we study relationships among the mappings $f$, $C_n(f)$ and $C^n_K(f)$ for the following classes of mappings: almost monotone, atriodic, confluent, joining, light, monotone, open, OM, pseudo-confluent, quasi-monotone, semi-confluent, strongly freely decomposable, weakly confluent, and weakly monotone.

ON EVEN-TO-ODD MEAN LABELING OF SOME TREES

Let G=(V(G), E(G)) be a connected graph with order |V(G)|=p and size |E(G)|=q. A graph G is said to be even-to-odd mean graph if there exists a bijection function phi:V(G) to {2, 4, ..., 2p} such that the induced mapping phi^*:E(G) to {3, 5, ..., 2p-1} defined by phi^*(uv)=[phi(u)+phi(v)]/2 for all uv element of E(G) is also bijective. The function is called an even-to-odd mean labeling of graph . This paper aimed to introduce a new technique in graph labeling. Hence, the concepts of even-to-odd mean labeling has been evaluated for some trees. In addition, we examined some properties of tree graphs that admits even-to-odd mean labeling and discussed some important results.

Edge δ− Graceful Labeling for Some Cyclic-Related Graphs

In this paper, we introduce a new type of labeling of a graph G with p vertices and q edges called edge δ− graceful labeling, for any positive integer δ, as a bijective mapping f of the edge set EG into the set δ,2δ,3δ,⋯,qδ such that the induced mapping f∗:VG→0,δ,2δ,3δ,⋯,qδ−δ, given by f∗u=∑uv∈EGfuvmodδk, where k=maxp,q, is an injective function. We prove the existence of an edge δ− graceful labeling, for any positive integer δ, for some cycle-related graphs like the wheel graph, alternate triangular cycle, double wheel graph Wn,n, the prism graph Πn, the prism of the wheel PWn, the gear graph Gn, the closed helm CHn, the butterfly graph Bn, and the friendship Frn.

Single Valued Neutrosophic Filters

In this paper we give a comprehensive presentation of the notions of filter base, filter and ultrafilter on single valued neutrosophic set and we investigate some of their properties and relationships. More precisely, we discuss properties related to filter completion, the image of neutrosophic filter base by a neutrosophic induced mapping and the infimum and supremum of two neutrosophic filter bases.

Uncertainty Propagation in Abstracted Systems via the Liouville Equation

This technical brief shows that given a system and its abstraction, the evolution of uncertain initial conditions in the original system is, in some sense, matched by the evolution of the uncertainty in the abstracted system. In other words, it is shown that the concept of Φ-related vector fields extends to the case of stochastic initial conditions where the probability density function (pdf) for the initial conditions is known. In the deterministic case, the Φ mapping commutes with the system dynamics. In this paper, we show that in the case of stochastic initial conditions, the induced mapping Φpdf commutes with the evolution of the pdf according to the Liouville equation.

The lifting property for classes of mappings

The lifting property of continua for classes of mappings is defined. It is shown that the property is preserved under the inverse limit operation. The results, when applied to the class of confluent mappings, exhibit conditions under which the induced mapping between hyperspaces is confluent. This generalizes previous results in this topic.