let g = (v,e) be a locally finite graph, i.e. a graph in which every vertex has finitely many adjacent vertices. in this paper, we associate a topology to g, called graphic topology of g and we show that it is an alexandroff topology, i.e. a topology in which intersec- tion of every family of open sets is open. then we investigate some properties of this topology. our motivation is to give an e...

In this paper we introduce the cone bounded linear mapping and demonstrate a proof to show that the cone norm is continuous. Among other things, we prove the open mapping theorem and the closed graph theorem in TVS-cone normed spaces. We also show that under some restrictions on the cone, two cone norms are equivalent if and only if the topologies induced by them are the same. In the sequel, we...

In this paper, we define topological hyperrings and study their basic concepts which supported by illustrative examples. We show some differences between topological rings and topological hyperrings. Also, by the fundamental relation $\Gamma^{*}$, we indicate the role of complete parts (saturated subsets) and complete hyperrings in topological hyperrings and specially we show that if every (clo...

modeling and simulation of processing plants are widely used in industry. construction of a mathematical model for a plant is a time-consuming and error-prone task. in light of extensive advancements in computer science (both hardware and software), computers are becoming a necessary instrument in industrial activities. many software tools for modeling, simulation and optimization of processing...

Let G = (V,E) be a locally finite graph, i.e. a graph in which every vertex has finitely many adjacent vertices. In this paper, we associate a topology to G, called graphic topology of G and we show that it is an Alexandroff topology, i.e. a topology in which intersec- tion of every family of open sets is open. Then we investigate some properties of this topology. Our motivation is to give an e...

in this paper, we introduce the concepts of right, left and product stabilizers on hoops and study some properties and the relation between them.  and we try to find that how they can be equal and investigate that under what condition they can be filter, implicative filter, fantastic and positive implicative filter. also, we prove that  right and product stabilizers are filters and if they are ...

Covering-based rough set theory is a useful tool to deal with inexact, uncertain or vague knowledge in information systems. Topology, one of the most important subjects in mathematics, provides mathematical tools and interesting topics in studying information systems and rough sets. In this paper, we present the topological characterizations to three types of covering approximation operators. F...