This paper introduces a relation between resultant and the Jacobian determinant
by generalizing Sakkalis theorem from two polynomials in two variables to the case of (n) polynomials in (n) variables. This leads us to study the results of the type:  ,            and use this relation to attack the Jacobian problem. The last section shows our contribution to proving the conjecture.

Consider the (p,q) simple connected graph . The sum absolute values of the spectrum of quotient matrix of a graph  make up the graph's quotient energy. The objective of this study is to examine the quotient energy of identity graphs and zero-divisor graphs  of commutative rings using group theory, graph theory, and applications. In this study, the identity graphs  derived from the group  and a few classes of zero-divisor graphs  of the commutative ring R are examined.

The main purpose of this paper, is to introduce a topological space , which is induced by reflexive graph and tolerance graph , such that  may be infinite. Furthermore, we offered some properties of  such as connectedness, compactness, Lindelöf and separate properties. We also study the concept of approximation spaces and get the sufficient and necessary condition that topological space is approximation spaces.

The aim of this paper is to generate topological structure on the power set of vertices of digraphs using new definition which is Gm-closure operator on out-linked of digraphs. Properties of this topological structure are studied and several examples are given. Also we give some new generalizations of some definitions in digraphs to the some known definitions in topology which are Ropen subgraph, α-open subgraph, pre-open subgraph, and β-open subgraph. Furthermore, we define and study the accuracy of these new generalizations on subgraps and paths.

A new type of the connected domination parameters called tadpole domination number of a graph is introduced. Tadpole domination number for some standard graphs is determined, and some bounds for this number are obtained. Additionally, a new graph, finite, simple, undirected and connected, is introduced named weaver graph. Tadpole domination is calculated for this graph with other families of graphs.

The aim of this article is to introduce a new definition of domination number in graphs called hn-domination number denoted by . This paper presents some properties which show the concepts of connected and independent hn-domination. Furthermore, some bounds of these parameters are determined, specifically, the impact on hn-domination parameter is studied thoroughly in this paper when a graph is modified by deleting or adding a vertex or deleting an edge.

     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

     The result involution graph of a finite group , denoted by  is an undirected simple graph whose vertex set is the whole group  and two distinct vertices are adjacent if their product is an involution element. In this paper, result involution graphs for all Mathieu groups and connectivity in the graph are studied. The diameter, radius and girth of this graph are also studied. Furthermore, several other graph properties are obtained.

     Graceful labeling of a graph  with q edges is assigned the labels for its vertices by some integers from the set such that no two vertices received the same label, where each edge is assigned the absolute value of the difference between the labels of its end vertices and the resulting edge labeling running from 1 to  inclusive. An edge labeling of a graph G is called vertex anntimagic, if all vertex weights are pairwise distinct, where the vertex weight of a vertex under an edge labeling is the sum of the label of all edges incident with that vertex.  In this paper, we address the problem of finding graceful antimagic labelin for split of the star graph ,  graph,  graph, jellyfish graph , Dragon graph , ki