In this ˑwork, we present theˑ notion of the ˑgraph for a KU-semigroup as theˑundirected simple graphˑ with the vertices are the elementsˑ of and weˑˑstudy the ˑgraph ofˑ equivalence classesˑofˑ which is determinedˑ by theˑ definition equivalenceˑ relation ofˑ these verticesˑ, andˑ then some related ˑproperties areˑ given. Several examples are presented and some theorems are proved. Byˑ usingˑ the definitionˑ ofˑ isomorphicˑ graph, ˑwe showˑ thatˑ the graphˑ of equivalence ˑclasses ˑand the ˑgraphˑof ˑa KU-semigroup ˑ areˑ theˑ sameˑ, in special cases.

          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.

      In this Ë‘work, we present theË‘ notion of the Ë‘graph for a KU-semigroup  as theË‘undirected simple graphË‘ with the vertices are the elementsË‘ of  and weË‘Ë‘study the Ë‘graph ofË‘ equivalence classesË‘ofË‘  which is determinedË‘ by theË‘ definition equivalenceË‘ relation ofË‘ these verticesË‘, andË‘ then some related Ë‘properties areË‘ given. Several examples are presented and some theorems are proved. ByË‘ usingË‘ the definitionË‘ ofË‘ isomorphicË‘ graph, Ë‘we showË‘ thatË‘ the graphË‘ of equivalence Ë‘classes Ë‘and the Ë‘graphË‘of Ë‘a KU-semigroup Ë‘  areË‘ theË‘ sameË‘,

In the present paper, we have introduced some new definitions On D- compact topological group and D-L. compact topological group for the compactification in topological spaces and groups, we obtain some results related to D- compact topological group and D-L. compact topological group.

In the present paper, we have introduced some new definitions On D- compact topological group and D-L. compact topological group for the compactification in topological spaces and groups, we obtain some results related to D- compact topological group and D-L. compact topological group.

In this paper the proton, neutron and matter density distributions and the corresponding root mean square (rms) radii of the ground states and the elastic magnetic electron scattering form factors and the magnetic dipole moments have been calculated for exotic nucleus of potassium isotopes K (A= 42, 43, 45, 47) based on the shell model using effective W0 interaction. The single-particle wave functions of harmonic-oscillator (HO) potential are used with the oscillator parameters b. According to this interaction, the valence nucleons are asummed to move in the d3f7 model space. The elastic magnetic electron scattering of the exotic nuclei 42K (J?T= 2- 2), 43K(J?T=3/2+ 5/2), 45K (J?T= 3/2+ 7/2) and 47K (J?T= 1/2+ 9/2) investigated t

Let A ⊆ V(H) of any graph H, every node w of H be labeled using a set of numbers; , where d(w,v) denotes the distance between node w and the node v in H, known as its open A-distance pattern. A graph H is known as the open distance-pattern uniform (odpu)-graph, if there is a nonempty subset A ⊆V(H) together with  is the same for all . Here  is known as the open distance pattern uniform (odpu-) labeling of the graph H and A is known as an odpu-set of H. The minimum cardinality of vertices in any odpu-set of H, if it exists, will be known as the odpu-number of the graph H. This article gives a characterization of maximal outerplanar-odpu graphs. Also, it establishes that the possible odpu-number of an odpu-maximal outerplanar graph i

Facial emotion recognition finds many real applications in the daily life like human robot interaction, eLearning, healthcare, customer services etc. The task of facial emotion recognition is not easy due to the difficulty in determining the effective feature set that can recognize the emotion conveyed within the facial expression accurately. Graph mining techniques are exploited in this paper to solve facial emotion recognition problem. After determining positions of facial landmarks in face region, twelve different graphs are constructed using four facial components to serve as a source for sub-graphs mining stage using gSpan algorithm. In each group, the discriminative set of sub-graphs are selected and fed to Deep Belief Network (DBN) f

The study of sex Structure and age characteristics of an important element of the
follow-up changes between different population groups, which are connected to a large degree
the demographic, social and economic characteristics, particularly since each population
group varying characteristics in terms of age, sex entail social, demographic, cultural and
economic implications, and from that the researcher has taken from Structure of sex and age
for population in the district of Tuz Khurmatu for (1997-2012 ) the subject of consideration
and maintain compared to see the contrast between them. Qualitative Research for installation
and the age of the urban and rural areas has touched the judiciary, as well as its respects