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, Si₂

In 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

            This 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.

Let M be a n-dimensional manifold. A C1- map f : M  M is called transversal if for all m N the graph of fm intersect transversally the diagonal of MM at each point (x,x) such that x is fixed point of fm. We study the minimal set of periods of f(M per (f)), where M has the same homology of the complex projective space and the real projective space. For maps of degree one we study the more general case of (M per (f)) for the class of continuous self-maps, where M has the same homology of the n-dimensional sphere.

A new class of generalized open sets in a topological space, called G-open sets, is introduced and studied. This class contains all semi-open, preopen, b-open and semi-preopen sets. It is proved that the topology generated by G-open sets contains the topology generated by preopen,b-open and semi-preopen sets respectively.

     A graph is a structure amounting to a set of objects in which some pairs of the objects are in some sense related. The objects correspond to mathematical abstractions called vertices (also called nodes or points) and each of the related pairs of vertices is called an edge (also called link or line). A directed graph is a graph in which edges have orientation. A simple graph is a graph that does not have more than one edge between any two vertices and no edge starts and ends at the same vertex.  For a simple undirected graph G with order n, and let  denotes its complement. Let δ(G), ∆(G) denotes the minimum degree and maximum degree of G respectively. The complement degree polynomial of G is the polynomial CD[G,x]= , where C

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