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.

In this paper, we introduce and study the notion of the maximal ideal graph of a commutative ring with identity. Let R be a commutative ring with identity. The maximal ideal graph of R, denoted by MG(R), is the undirected graph with vertex set, the set of non-trivial ideals of R, where two vertices I₁ and I₂ are adjacent if I₁ I₂ and I₁+I₂ is a maximal ideal of R. We explore some of the properties and characterizations of the graph.

The aim of this research is to investigate the skills of the chemistry students from the Ibn Al-Haytham Education college of pure sciences in Baghdad in understanding and constructing graphical representations of data. The research sample consisted of (101) male and female students in their fourth year of study during the 2016-2017 academic year. This sample represents 71% of the total number of students in this group.The research methodology used consisted of two parts relating to 19 issues. The first part is an objective multi choice type of test to measure the student’s skill in selecting the right representation of specific subject graph amongst many provided. The second part concentrated on measuring the student’s skill in construc

   For a finite group G, the intersection graph   of G is the graph whose vertex set is the set of all proper non-trivial subgroups of G, where two distinct vertices are adjacent if their intersection is a non-trivial subgroup of G. In this article, we investigate the detour index, eccentric connectivity, and total eccentricity polynomials of the intersection graph  of subgroups of the dihedral group  for distinct primes . We also find the mean distance of the graph  .

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.

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.

     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.

The present study introduces the concept of J-pure submodules as a generalization of pure submodules. We  study some of its basic  properties  and  by using this concept we  define the class of  J-regular modules,  where an R-module  M is called  J-regular module if every submodule of M is J-pure submodule. Many results about this concept are proved

      Let S be a commutative ring with identity, and A is an S-module. This paper introduced an important concept, namely strongly maximal submodule. Some properties and many results were proved as well as the behavior of that concept with its localization was studied and shown.