The main object of this paper is to study the representations of monomial groups and characters technique for representations of monomial groups. We refer to monomial groups by M-groups. Moreover we investigate the relation of monomial groups and solvable groups. Many applications have been given the symbol G e.g. group of order 297 is an M-group and solvable. For any group G, the factor group G/G? (G? is the derived subgroup of G) is an M-group in particular if G = Sn, SL(4,R).

In a connected graph , the distance function between each pair of two vertices from a set vertex  is the shortest distance between them and the vertex degree  denoted by  is the number of edges which are incident to the vertex  The Schultz and modified Schultz polynomials of  are have defined as:

 respectively, where the summations are taken over all unordered pairs of distinct vertices in  and  is the distance between  and  in  The general forms of Schultz and modified Schultz polynomials shall be found and indices of the edge – identification chain and ring – square graphs in the present work.

In this work,  the study of corona domination in graphs is carried over which was initially proposed by G. Mahadevan et al. Let be a simple graph. A dominating set S of a graph is said to be a corona-dominating set if every vertex in is either a pendant vertex or a support vertex. The minimum cardinality among all corona-dominating sets is called the corona-domination number and is denoted by (i.e) . In this work, the exact value of the corona domination number for some specific types of graphs are given. Also, some results on the corona domination number for some classes of graphs are obtained and the method used in this paper is a well-known number theory concept with some modification this method can also be applied to obt

     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 research, an analysis for the standard Hueckel edge detection algorithm behaviour by using three dimensional representations for the edge goodness criterion is presents after applying it on a real high texture satellite image, where the edge goodness criterion is analysis statistically. The Hueckel edge detection algorithm showed a forward exponential relationship between the execution time with the used disk radius. Hueckel restrictions that mentioned in his papers are adopted in this research. A discussion for the resultant edge shape and malformation is presented, since this is the first practical study of applying Hueckel edge detection algorithm on a real high texture image containing ramp edges (satellite image).

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

An analytical form of the ground state charge density distributions
for the low mass fp shell nuclei ( 40  A  56 ) is derived from a
simple method based on the use of the single particle wave functions
of the harmonic oscillator potential and the occupation numbers of
the states, which are determined from the comparison between theory
and experiment.
For investigating the inelastic longitudinal electron scattering form
factors, an expression for the transition charge density is studied
where the deformation in nuclear collective modes is taken into
consideration besides the shell model space transition density. The
core polarization transition density is evaluated by adopting the
shape of Tassie mod

 An analytical form of the ground state charge density distributions
for the low mass fp shell nuclei ( 40  A  56 ) is derived from a
simple method based on the use of the single particle wave functions
of the harmonic oscillator potential and the occupation numbers of
the states, which are determined from the comparison between theory
and experiment.
For investigating the inelastic longitudinal electron scattering form
factors, an expression for the transition charge density is studied
where the deformation in nuclear collective modes is taken into
consideration besides the shell model space transition density. The
core polarization transition density is evaluated by adopting the
shape of Tass

0

The railways network is one of the huge infrastructure projects. Therefore, dealing with these projects such as analyzing and developing should be done using appropriate tools, i.e. GIS tools. Because, traditional methods will consume resources, time, money and the results maybe not accurate. In this research, the train stations in all of Iraq’s provinces were studied and analyzed using network analysis, which is one of the most powerful techniques within GIS. A free trial copy of ArcGIS®10.2 software was used in this research in order to achieve the aim of this study. The analysis of current train stations has been done depending on the road network, because people used roads to reach those train stations. The data layers for this st