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.
The analysis of survival and reliability considered of topics and methods of vital statistics at the present time because of their importance in the various demographical, medical, industrial and engineering fields. This research focused generate random data for samples from the probability distribution Generalized Gamma: GG, known as: "Inverse Transformation" Method: ITM, which includes the distribution cycle integration function incomplete Gamma integration making it more difficult classical estimation so will be the need to illustration to the method of numerical approximation and then appreciation of the function of survival function. It was estimated survival function by simulation the way "Monte Carlo". The Entropy method used for the
... Show MoreChoosing antimicrobials is a common dilemma when the expected rate of bacterial resistance is high. The observed resistance values in unequal groups of isolates tested for different antimicrobials can be misleading. This can affect the decision to recommend one antibiotic over the other. We analyzed recalled data with the statistical consideration of unequal sample groups. Data was collected concerning children suspected to have typhoid fever at Al Alwyia Pediatric Teaching Hospital in Baghdad, Iraq. The study period extended from September 2021 to September 2022. A novel algorithm was developed to compare the drug sensitivity among unequal numbers of Salmonella typhi (S. Typhi) isolates tested with different antibacterials.
... Show MoreBackground. Aneurysms of the distal anterior cerebral artery (DACA) are uncommon; they often form near the pericallosal-callosomarginal junction and are typically small. To our knowledge, giant DACA aneurysms developing from the more distant parts of the anterior cerebral artery (ACA), A4-5, have been described only once in the literature. Case description. A 66-year-old gentleman reported with a brief loss of consciousness followed by weakness in his right lower leg. The patient was admitted with a Glasgow Coma Score (GCS) of 15. A computed tomography (CT) scan of the head revealed a left hyperdense mass in the frontal parasagittal supracallosal region. Contrast MRI revealed a heterogeneously enhancing mass measuring 35x30x25 mm. C
... Show MoreOrganohalosilanes conslitute an important subject ١٦؛ the chemistry oforganosilicon compound؛. Being starting materials and intermediates in the synthesis of a large number of various compounds so it is very important to get such materials in its highest purity ,but the separation of rathylchlorosilanes was still a big^oblem, duet^the great similarity in their physical and chemical properties, making its analysing verydifficult, ^or this reason tteir must be a good method o^e^r^iondealing^ththe^compounds, gas- liquid chromatography proved that it was the best, specially when (m- nitrotoluene) was used as a stationary liquid phase, it gave a complete separation and a good statistical results
The research discusses the formal transformation in urban structure, all the cities around the world have undergone a series of formal transformations, resulting in radical transformations to their functions. And to calculate this transformation the descriptive analytical method was applied to this research. First, local urban management data and Landsat-9 visual data were used after processing by GIS. Then, the data were processed mathematically based on their engineering sequences. The aims of this research were as follows: to explore the formal transformations in cities, their dimensions and their consequences and impacts; to identify the underlying causes of their occurrence by deriving realistic results from trends in such degrees of t
... Show MoreIn 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.
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
... Show MoreLet 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
... Show More