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.

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).

0

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

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

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

In this work, we study several features of the non-zero divisor graphs (ℵZD- graph) for the ring Zn of integer modulo n. For instance, the clique number, radius, girth, domination number, and the local clustering coefficient are determined. Furthermore, we present an algorithm that calculates the clique number and draws the non-zero divisor for the ring Zn.

The problem of finding the cyclic decomposition (c.d.) for the groups ), where  prime upper than 9 is determined in this work. Also, we compute the Artin characters (A.ch.) and Artin indicator (A.ind.) for the same groups, we obtain that after computing the conjugacy classes, cyclic subgroups, the ordinary character table (o.ch.ta.) and the rational valued character table for each group.