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.

This in vitro study evaluated the influence of chemomechanical caries removal solution on the surface topography of metal-ceramic feldspar porcelain (MAJOR ceramic) and All-ceramic feldspar porcelain (Vita Alpha) using light polarizing microscope. Forty specimens of MAJOR ceramic and forty specimens of Vita Alpha ceramic of (12mm diameter & 3mm height) were prepared .All specimens were polished with silicon polishing burs, cleaned, autoglazed and stored in 37°C before exposure to Carisolv. Thirty specimens of each material randomly exposed to Carisolv gel for 5, 10 and 20 minutes respectively, other ten specimens were not, to act as control group. All specimens were subjected to surface roughness test by profilometer and evalua

The notion of interval value fuzzy k-ideal of KU-semigroup was studied as a generalization of afuzzy k-ideal of KU-semigroup. Some results of this idea under homomorphism are discussed. Also, we presented some properties about the image (pre-image) for interval~ valued fuzzy~k-ideals of a KU-semigroup. Finally, the~ product of~ interval valued fuzzyk-ideals is established.

The molar ratio(x) of Li-Ni ferrites in the formula Li0.5-0.5xNixFe2.5-
0.5xO4 was varied in range 0.1-1.0 by hydrothermal process. The
XRD, SEM, and TEM tests were conducted to examine the samples
crystalline phase and to characterize the particles shapes and sizes.
The high purity spinel structure was obtained at med and high x
values. SEM and TEM images showed the existence of different
ferrite particles shapes like nanospheres and nanorods. The
maximum particle size is around (20nm). These size encourage
occurrence of super paramagnetic state. The reflection loss and
insertion loss as microwave losses of Li-Ni ferrite-epoxy composite
of 1mm thickness and mixing ratio 39.4 wt was investigated. The
mini

Background: The ideal maxillofacial prosthesis should have fine and thin boundaries that bindwith the surrounding facial structures and possess high tear strength.This study aims to determinethe best percentages of nanofiller (TiO2) and intrinsic pigment (silicone functional intrinsic) thatcould be mixed in as additives to improve the tear strength of Cosmesil M511 andVST50F siliconeelastomers with the least effect on their hardness.Materials and Methods: In this in vitro experimental study, a total of 80 samples, 40 for eachelastomer, were fabricated. Each elastomer sample was split into two equal groups to test for tearstrength and Shore A hardness. Each group consisted of 20 samples, including 10 control sampleswithout additives and 10 e

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