Let  be a non-trivial simple graph. A dominating set in a graph is a set of vertices such that every vertex not in the set is adjacent to at least one vertex in the set. A subset  is a minimum neighborhood dominating set if  is a dominating set and if for every  holds. The minimum cardinality of the minimum neighborhood dominating set of a graph  is called as minimum neighborhood dominating number and it is denoted by  . A minimum neighborhood dominating set is a dominating set where the intersection of the neighborhoods of all vertices in the set is as small as possible, (i.e., ). The minimum neighborhood dominating number, denoted by , is the minimum cardinality of a minimum neighborhood dominating set. In other words, it is the

Background: There are many congenital anomalies associated with cleft lip and/or palate. This research is to study the prevalence of congenitally missing teeth and supernumerary teeth in this population group. Materials and Method: One hundred eight cleft lip and/or palate Iraqi patients had participated in this study (57 male, 51 female), 3-12 years of age. 26 of them had orthopantomogram were within (6-12) years of age were inspected for congenitally missing teeth and supernumerary teeth. Patients whom age range 3-5 years were checked for the congenitally missing teeth by clinical examination with strongly insisting the teeth were not missed due to caries or trauma. Results: There were 19(73.076%) patients with 41 congenitally missing tee

Abstract

    In order to enhance the efficiency of flat plate solar water collectors without changing in its original shape and with low additional cost, twisted strips are inserted inside its riser pipes. Three flat plate collectors are used for test. Family of twisted strips are inserted inside each collector risers with different twisted ratios (T_R=3,4,5). The collectors are connected in parallel mode (Z-Configuration) and are exposed to the same conditions (solar radiation and ambient temperature) .The experimental results show that, the highest heat transfer rate occurs at twisted ratio (3) .Consequently, for the same twisted ratio the daily efficiencies for the solar collector at d

This paper is concerned with introducing and studying the M-space by using the mixed degree systems which are the core concept in this paper. The necessary and sufficient condition for the equivalence of two reflexive M-spaces is super imposed. In addition, the m-derived graphs, m-open graphs, m-closed graphs, m-interior operators, m-closure operators and M-subspace are introduced. From an M-space, a unique supratopological space is introduced. Furthermore, the m-continuous (m-open and m-closed) functions are defined and the fundamental theorem of the m-continuity is provided. Finally, the m-homeomorphism is defined and some of its properties are investigated.

Focal adhesion kinase (FAK), ephrin receptor type A4 (EphA4), and adiponectin (ADPN) are important indicators in inflammation, tumor growth, migration, and angiogenesis in some cancers. The predictive impact of their concentrations in acute myeloid leukemia (AML) patients to be identified remains. The research sought to explore the effect of FAK, EphA4, and ADPN as prognostic biomarkers, and their influence on patient survival, and to look for any potential correlation between their levels with hematological parameters in AML patients.

This paper is concerned with introducing and studying the o-space by using out degree system (resp. i-space by using in degree system) which are the core concept in this paper. In addition, the m-lower approximations, the m-upper approximations and ospace and i-space. Furthermore, we introduce near supraopen (near supraclosed) d. g.'s. Finally, the supra-lower approximation, supraupper approximation, supra-accuracy are defined and some of its properties are investigated.

Recent years have seen an explosion in graph data from a variety of scientific, social and technological fields. From these fields, emotion recognition is an interesting research area because it finds many applications in real life such as in effective social robotics to increase the interactivity of the robot with human, driver safety during driving, pain monitoring during surgery etc. A novel facial emotion recognition based on graph mining has been proposed in this paper to make a paradigm shift in the way of representing the face region, where the face region is represented as a graph of nodes and edges and the gSpan frequent sub-graphs mining algorithm is used to find the frequent sub-structures in the graph database of each emotion. T