An R-module M is called rationally extending if each submodule of M is rational in a direct summand of M. In this paper we study this class of modules which is contained in the class of extending modules, Also we consider the class of strongly quasi-monoform modules, an R-module M is called strongly quasi-monoform if every nonzero proper submodule of M is quasi-invertible relative to some direct summand of M. Conditions are investigated to identify between these classes. Several properties are considered for such modules

This paper is devoted to the discussion the relationships of connectedness between some types of graphs (resp. digraph) and Gm-closure spaces by using graph closure operators.

The primary aim of this paper, is to introduce the rough probability from topological view. We used the Gm-topological spaces which result from the digraph on the stochastic approximation spaces to upper and lower distribution functions, the upper and lower mathematical expectations, the upper and lower variances, the upper and lower standard deviation and the upper and lower r th moment. Different levels for those concepts are introduced, also we introduced some results based upon those concepts.

     This article introduces the concept of finitely null-additive set function relative to the σ– ring and many properties of this concept have been discussed. Furthermore, to introduce and study the notion of finitely weakly null-additive set function relative to the σ– ring as a generalization of some concepts such as measure, countably additive, finitely additive, countably null-additive, countably weakly null-additive and finitely null-additive. As the first result, it has been proved that every finitely null-additive is a finitely weakly null-additive. Finally, the paper introduces a study of the concept of outer measure as a stronger form of finitely weakly null-additive.

The basic concepts of some near open subgraphs, near rough, near exact and near fuzzy graphs are introduced and sufficiently illustrated. The Gm-closure space induced by closure operators is used to generalize the basic rough graph concepts. We introduce the near exactness and near roughness by applying the near concepts to make more accuracy for definability of graphs. We give a new definition for a membership function to find near interior, near boundary and near exterior vertices. Moreover, proved results, examples and counter examples are provided. The Gm-closure structure which suggested in this paper opens up the way for applying rich amount of topological facts and methods in the process of granular computing.