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.
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.
Most real-life situations need some sort of approximation to fit mathematical models. The beauty of using topology in approximation is achieved via obtaining approximation for qualitative subgraphs without coding or using assumption. The aim of this paper is to apply near concepts in the -closure approximation spaces. The basic notions of near approximations are introduced and sufficiently illustrated. Near approximations are considered as mathematical tools to modify the approximations of graphs. Moreover, proved results, examples, and counterexamples are provided.
In this paper we define and study new concepts of fibrewise topological spaces over B namely, fibrewise near compact and fibrewise locally near compact spaces, which are generalizations of well-known concepts near compact and locally near compact topological spaces. Moreover, we study relationships between fibrewise near compact (resp., fibrewise locally near compact) spaces and some fibrewise near separation axioms.
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.
In this paper we define and study new concepts of fibrewise topological spaces over B namely, fibrewise near topological spaces over B. Also, we introduce the concepts of fibrewise near closed and near open topological spaces over B; Furthermore we state and prove several Propositions concerning with these concepts.
The theory of general topology view for continuous mappings is general version and is applied for topological graph theory. Separation axioms can be regard as tools for distinguishing objects in information systems. Rough theory is one of map the topology to uncertainty. The aim of this work is to presented graph, continuity, separation properties and rough set to put a new approaches for uncertainty. For the introduce of various levels of approximations, we introduce several levels of continuity and separation axioms on graphs in Gm-closure approximation spaces.
The purpose of this paper is to consider fibrewise near versions of the more important separation axioms of ordinary topology namely fibrewise near T0 spaces, fibrewise near T1 spaces, fibrewise near R0 spaces, fibrewise near Hausdorff spaces, fibrewise near functionally Hausdorff spaces, fibrewise near regular spaces, fibrewise near completely regular spaces, fibrewise near normal spaces and fibrewise near functionally normal spaces. Also we give several results concerning it.
In this paper, the bi-criteria machine scheduling problems (BMSP) are solved, where the discussed problem is represented by the sum of completion and the sum of late work times simultaneously. In order to solve the suggested BMSP, some metaheurisitc methods are suggested which produce good results. The suggested local search methods are simulated annulling and bees algorithm. The results of the new metaheurisitc methods are compared with the complete enumeration method, which is considered an exact method, then compared results of the heuristics with each other to obtain the most efficient method.
In this paper we generalize some of the results due to Bell and Mason on a near-ring N admitting a derivation D , and we will show that the body of evidence on prime near-rings with derivations have the behavior of the ring. Our purpose in this work is to explore further this ring like behavior. Also, we show that under appropriate additional hypothesis a near-ring must be a commutative ring.
The main purpose of this paper is to show that zero symmetric prime near-rings, satisfying certain identities on n-derivations, are commutative rings.