In this paper we introduce intuitionistic fuzzy completely regular weakly generalized continuous mappings and some of their properties are studied.

A graph G = (V, E) is called weakly four-connected if G is 4-edge-connected and G − x is 2-edge-connected for all x ∈ V . We give sufficient conditions for the existence of ‘splittable’ vertices of degree four in weakly four-connected graphs. By using these results we prove that every minimally weakly fourconnected graph on at least four vertices contains at least three ‘splittable’ vertices of...

This paper studies the vector optimization problem of finding weakly efficient points for maps from R to R, with respect to the partial order induced by a closed, convex, and pointed cone C ⊂ R, with nonempty interior. We develop for this problem an extension of the proximal point method for scalar-valued convex optimization problem with a modified convergence sensing conditon that allows us to...

In this paper we introduce an inexact proximal point algorithm using proximal distances for solving variational inequality problems when the mapping is pseudomonotone or quasimonotone. Under some natural assumptions we prove that the sequence generates by the algorithm is convergent for the pseudomonotone case and weakly convergent for the quasimonotone ones. This approach unifies the results o...

in this paper, we first discuss about canonical dual of g-frameλp = {λip ∈ b(h, hi) : i ∈ i}, where λ = {λi ∈ b(h, hi) :i ∈ i} is a g-frame for a hilbert space h and p is the orthogonalprojection from h onto a closed subspace m. next, we provethat, if λ = {λi ∈ b(h, hi) : i ∈ i} and θ = {θi ∈ b(k, hi) :i ∈ i} be respective g-frames for non zero hilbert spaces hand k, and λ and θ are unitarily e...

A labeled graph is said to be weakly bipartite if the clutter of its odd cycles is ideal. Seymour conjectured that a labeled graph is weakly bipartite if and only if it does not contain a minor called an oddK5. A proof of this conjecture is given in this paper. Let G = (V;E) be a graph and E. We call edges in odd and edges in E even. The pair (G; ) is called a labeled graph. A subset L E(G) is ...

In this paper, we first construct a preconditioned two-parameter generalized Hermitian and skew-Hermitian splitting (PTGHSS) iteration method based on the two-parameter generalized Hermitian and skew-Hermitian splitting (TGHSS) iteration method for non-Hermitian positive definite linear systems. Then a class of PTGHSSbased iteration methods are proposed for solving weakly nonlinear systems base...