In the partition theory, there is more then one form of representation of dedication, most notably the Abacus diagram, which gives an accurate and specific description. In the year 2019, Mahmood and Mahmood presented the idea of merging more than two plans, and then the following question was raised: Is the process of separating any somewhat large diagram into smaller schemes possible? The general formula to split e-abacus diagram into two or more equal or unequal parts was achieved in this study now.

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 aims to introduce and to study a new kind of divisor graph which is  called idempotent divisor graph, and it is  denoted by . Two non-zero distinct vertices v₁ and v₂ are adjacent if and only if , for some non-unit idempotent element . We establish some fundamental properties of ,  as well as it’s connection with . We also study planarity of this graph.

In this paper, the complex of Lascoux in the case of partition (3,3,2) has been studied by using diagrams ,divided power of the place polarization ) (k ij ,Capelli identites and the idea of mapping Cone .

In this paper the diagrams and divided power of the place polarization
(k )
ij  , with
its capelli identities have been used, to study the complex of Lascoux in case of the
partition (4,4,4).

The aim of this work is to study the application of Weyl module resolution in the case of two rows, which will be specified in the partition (7, 6) and skew- partition (7,6)/(1,0)  by using the homological Weyl (i.e. the contracting homotopy and place polarization).

A graph
is said to be singular if and only if its adjacency matrix is singular. A graph
is said to be bipartite graph if and only if we can write its vertex set as
, and each edge has exactly one end point in
and other end point in
. In this work, we will use graphic permutation to find the determinant of adjacency matrix of bipartite graph. After that, we will determine the conditions that the bipartite graph is singular or non-singular.

The concept of the order sum graph associated with a finite group based on the order of the group and order of group elements is introduced. Some of the properties and characteristics such as size, chromatic number, domination number, diameter, circumference, independence number, clique number, vertex connectivity, spectra, and Laplacian spectra of the order sum graph are determined. Characterizations of the order sum graph to be complete, perfect, etc. are also obtained.

Recent years have seen an explosion in graph data from a variety of scientific, social and technological fields. From these fields, emotion recognition is an interesting research area because it finds many applications in real life such as in effective social robotics to increase the interactivity of the robot with human, driver safety during driving, pain monitoring during surgery etc. A novel facial emotion recognition based on graph mining has been proposed in this paper to make a paradigm shift in the way of representing the face region, where the face region is represented as a graph of nodes and edges and the gSpan frequent sub-graphs mining algorithm is used to find the frequent sub-structures in the graph database of each emotion. T

     . Suppose that  is the Cayley graph whose vertices are all elements of  and two vertices  and  are adjacent if and only if . In this paper,we introduce the generalized Cayley graph denoted by  which is a graph with a vertex set consisting of all column matrices  in which all components are in  and two vertices  and  are adjacent if and only if , where  is a column matrix that each entry is the inverse of the similar entry of  and  is  matrix with all entries in  ,  is the transpose of  and  and m . We aim to provide some basic properties of the new graph and determine the structure of  when  is a complete graph  for every , and n, m  .