With simple and undirected connected graph Φ, the Schultz and modified Schultz polynomials are defined as  and , respectively, where the summation is taken over all unordered pairs of distinct vertices in V(Φ), where V(Φ) is the vertex set of Φ, degu  is the degree of vertex u and d(v,u) is the ordinary distance between v and u, u≠v. In this study, the Shultz distance, modified Schultz distance, the polynomial, index, and average for both have been generalized, and this generalization has been applied  to some special graphs.

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.

F index is a connected graph, sum of the cubes of the vertex degrees. The forgotten topological index has been designed to be employed in the examination of drug molecular structures, which is extremely useful for pharmaceutical and medical experts in understanding the biological activities. Among all the topological indices, the forgotten index is based on degree connectivity on bonds. This paper characterized the forgotten index of union of graphs, join graphs, limits on trees and its complements, and accuracy is measured. Co-index values are analyzed for the various molecular structure of chemical compounds

Suppose that  is a finite group and  is a non-empty subset of  such that  and . 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  that  is a graph with vertex set consists of all column matrices  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 similar entry of  and  is  matrix with all entries in  ,  is the transpose of  and . In this paper, we clarify some basic properties of the new graph and assign the structure of  when  is complete graph , complete bipartite graph  and complete

          A total global dominator coloring of a graph  is a proper vertex coloring of  with respect to which every vertex  in  dominates a color class, not containing  and does not dominate another color class. The minimum number of colors required in such a coloring of  is called the total global dominator chromatic number, denoted by . In this paper, the total global dominator chromatic number of trees and unicyclic graphs are explored.

         Let R be a commutative ring , the pseudo – von neuman  regular graph of the ring R is define as a graph whose vertex set consists of all elements of R and any two distinct vertices a and b are adjacent if and only if   , this graph denoted by P-VG(R) ,  in this work we got some new results a bout chromatic number of  P-VG(R).

A topological index, commonly referred to as a connectivity index, is a molecular structural descriptor that describes a chemical compound's topology. Topological indices are a major topic in graph theory. In this paper, we first define a new graph, which is a concept from the coronavirus, called a corona graph, and then we give some theoretical results for the Wiener and the hyper Wiener index of a graph, according to ( the number of pairs of vertices (u, v) of G that are at a distance . Moreover, calculate some topological indices degree-based, such as the first and second Zagreb index, ,  and  index, and first and second Gourava index for the recent graph. In addition, we introduced a new topological index, the , w

The local resolving neighborhood  of a pair of vertices  for  and  is if there is a vertex  in a connected graph  where the distance from  to  is not equal to the distance from  to , or defined by . A local resolving function  of  is a real valued function   such that  for  and . The local fractional metric dimension of graph  denoted by , defined by  In this research, the author discusses about the local fractional metric dimension of comb product are two graphs, namely graph  and graph , where graph  is a connected graphs and graph  is a complate graph &

The research aims to explain the role of the flexible budget in assessing the feedback resulting from deviations by comparing the actual results with the planned performance in light of the economic crisis that the world witnessed during the spread of Corona disease. As most companies, including the Electronic Industries Company, face the problem of controlling production costs and are trying hard to reduce these costs to the lowest level starting from measuring these costs and allocating them and distributing them to products. This helps in controlling deviations and thus the flexible budget becomes a tool that helps in controlling elements Costs

Antimagic labeling of a graph  with  vertices and  edges is assigned the labels for its edges by some integers from the set , such that no two edges received the same label, and the weights of vertices of a graph  are pairwise distinct. Where the vertex-weights of a vertex  under this labeling is the sum of labels of all edges incident to this vertex, in this paper, we deal with the problem of finding vertex antimagic edge labeling for some special families of graphs called strong face graphs. We prove that vertex antimagic, edge labeling for strong face ladder graph , strong face wheel graph ,  strong face fan graph , strong face prism graph  and finally strong face friendship graph .