Relation on a set is a simple mathematical model to which many real-life data can be connected. A binary relation on a set can always be represented by a digraph. Topology on a set can be generated by binary relations on the set . In this direction, the study will consider different classical categories of topological spaces whose topology is defined by the binary relations adjacency and reachability on the vertex set of a directed graph. This paper analyses some properties of these topologies and studies the properties of closure and interior of the vertex set of subgraphs of a digraph. Further, some applications of topology generated by digraphs in the study of biological systems are cited.
The use of silicon carbide is increasing significantly in the fields of research and technology. Topological indices enable data gathering on algebraic graphs and provide a mathematical framework for analyzing the chemical structural characteristics. In this paper, well-known degree-based topological indices are used to analyze the chemical structures of silicon carbides. To evaluate the features of various chemical or non-chemical networks, a variety of topological indices are defined. In this paper, a new concept related to the degree of the graph called "bi-distance" is introduced, which is used to calculate all the additive as well as multiplicative degree-based indices for the isomer of silicon carbide, Si2
... Show MoreIn this paper, we define some generalizations of topological group namely -topological group, -topological group and -topological group with illustrative examples. Also, we define grill topological group with respect to a grill. Later, we deliberate the quotient on generalizations of topological group in particular -topological group. Moreover, we model a robotic system which relays on the quotient of -topological group.
In this thesis, we study the topological structure in graph theory and various related results. Chapter one, contains fundamental concept of topology and basic definitions about near open sets and give an account of uncertainty rough sets theories also, we introduce the concepts of graph theory. Chapter two, deals with main concepts concerning topological structures using mixed degree systems in graph theory, which is M-space by using the mixed degree systems. In addition, the m-derived graphs, m-open graphs, m-closed graphs, m-interior operators, m-closure operators and M-subspace are defined and studied. In chapter three we study supra-approximation spaces using mixed degree systems and primary object in this chapter are two topological
... Show MoreThis work, introduces some concepts in bitopological spaces, which are nm-j-ω-converges to a subset, nm-j-ω-directed toward a set, nm-j-ω-closed mappings, nm-j-ω-rigid set, and nm-j-ω-continuous mappings. The mainline idea in this paper is nm-j-ω-perfect mappings in bitopological spaces such that n = 1,2 and m =1,2 n ≠ m. Characterizations concerning these concepts and several theorems are studied, where j = q , δ, a , pre, b, b.
This paper is concerned with introducing and studying the M-space by using the mixed degree systems which are the core concept in this paper. The necessary and sufficient condition for the equivalence of two reflexive M-spaces is super imposed. In addition, the m-derived graphs, m-open graphs, m-closed graphs, m-interior operators, m-closure operators and M-subspace are introduced. From an M-space, a unique supratopological space is introduced. Furthermore, the m-continuous (m-open and m-closed) functions are defined and the fundamental theorem of the m-continuity is provided. Finally, the m-homeomorphism is defined and some of its properties are investigated.
In this paper, we procure the notions of neutrosophic simply b-open set, neutrosophic simply b-open cover, and neutrosophic simply b-compactness via neutrosophic topological spaces. Then, we establish some remarks, propositions, and theorems on neutrosophic simply
b-compactness. Further, we furnish some counter examples where the result fails.
In this article an attempt has been made to procure the concept of pairwise neutrosophic simply open set, pairwise neutrosophic simply continuous mapping, pairwise neutrosophic simply open mapping, pairwise neutrosophic simply compactness, pairwise neutrosophic simply b-open set, pairwise neutrosophic simply b-continuous mapping, pairwise neutrosophic simply b-open mapping and pairwise neutrosophic simply b-compactness via neutrosophic bi-topological spaces (in short NBTS). Besides, we furnish few illustrative examples on them via NBTS. Further, we investigate some basic properties of them, and formulate several results on NBTSs.
The multiplicity of connotations in any paper does not mean that there is no main objective for that paper and certainly one of these papers is our research the main objective is to introduce a new connotation which is type-2 fuzzy somewhere dense set in general type-2 fuzzy topological space and its relationship with open sets of the connotation type-2 fuzzy set in the same space topology and theories of this connotation.
In this thesis, we introduce eight types of topologies on a finite digraphs and state the implication between these topologies. Also we studied some pawlak's concepts and generalization rough set theory, we introduce a new types for approximation rough digraphs depending on supra open digraphs. In addition, we present two various standpoints to define generalized membership relations, and state the implication between it, to classify the digraphs and help for measure exactness and roughness of digraphs. On the other hand, we define several kinds of fuzzy digraphs. We also introduce a topological space, which is induced by reflexive graph and tolerance graphs, such that the graph may be infinite. Furthermore, we offered some properties of th
... Show MoreThe primary objective of this paper, is to introduce eight types of topologies on a finite digraphs and state the implication between these topologies. Also we used supra open digraphs to introduce a new types for approximation rough digraphs.