We only prove that f is single-valued neutrosophic soft closed since f is a

bijective mapping. Let a single-valued neutrosophic soft set [mathematical expression not reproducible] be closed in Kalgebra [K.sub.1].

Problem statement: Find a differentiable

bijective mapping function m that takes as input the tuples of the input image and outputs a new set of tuples whose statistics match the statistics of the target tuples.

An isomorphism g from [G.sub.1] to [G.sub.2] is a

bijective mapping g : [V.sub.1] [right arrow] [V.sub.2] which satisfies the following conditions:

A weak isomorphism f: H [right arrow] K between two SVNHGs H = (X, E, R) and K = (Y, F, S) is a

bijective mapping f: X [right arrow] Y, which satisfies f is homomorphism, such that:

Kotzig and Rosa [17] defined a magic labeling on a graph G to be a

bijective mapping that assigns the integers from 1 to p+q to all the vertices and edges such that the sums of the labels on an edge and its two endpoints is constant for each edge.

In the boolean case, the existence of an in situ program with 2n--1 assignments for a

bijective mapping is equivalent to the well known [2] rearrangeability of the Benes network (i.e.

An isomorphism from [G.sub.1] to [G.sub.2] is a

bijective mapping f : [V.sub.1] [right arrow] [V.sub.2] which satisfies [A.sub.1](x) = [A.sub.2](f(x)) ([for all]x [member of] [V.sub.1]) and [B.sub.1]({x, y)) = [B.sub.2]((f(x), f(y))) ([for all](x,y) [member of] [E.sub.1]).

An isomorphism f : [G.sub.1] [right arrow] [G.sub.2] is a

bijective mapping f : [V.sub.1] [right arrow] [V.sub.2] which satisfies the following conditions:

If f is

bijective mapping and [f.sup.-1]: (Y, [sigma]) [right arrow] (X, [tau]) is [[alpha].sub.([gamma],id)]-continuous, then f is [[alpha].sub.(id, [gamma]')]-closed.

For all a, a' [member of] D and [r.sub.a] [member of] R, there exists a

bijective mapping h : B(a, [r.sub.a]) [right arrow] B (a', [r.sub.a]) (with restriction h : B (a, [r.sub.a]) [intersection] [[bar.H].sub.aa'] [right arrow] B (a', [r.sub.a]) [intersection] [[bar.H].sub.a'a]) such that h (x) = y only if [u.sub.y] (a) = [u.sub.x] (a') and [u.sub.x] (a) = [u.sub.y](a').

Let f : (X, [tau]) [right arrow] (Y, [sigma]) be an IFWG * open

bijective mapping from an IFTS (X, [tau]) onto an IFTS (Y, [sigma]).