Graceful labeling of a graph  with q edges is assigned the labels for its vertices by some integers from the set such that no two vertices received the same label, where each edge is assigned the absolute value of the difference between the labels of its end vertices and the resulting edge labeling running from 1 to  inclusive. An edge labeling of a graph G is called vertex anntimagic, if all vertex weights are pairwise distinct, where the vertex weight of a vertex under an edge labeling is the sum of the label of all edges incident with that vertex.  In this paper, we address the problem of finding graceful antimagic labelin for split of the star graph ,  graph,  graph, jellyfish graph , Dragon graph , ki

Background: The displacement of artificial teeth during complete denture construction presents major processing errors in the occlusal vertical dimension which were verified at the previous trial denture stage. The aim of this study was to assess the effect of delay in processing after final flask closure and tension application on the vertical acrylic and porcelain teeth displacement of complete dentures constructed from heat cured acrylic and the results were compared with the conventional processing method. Materials and methods: forty samples of identical maxillary complete dentures were constructed from heat polymerized acrylic resin. These samples were subdivided into the following experimental subgroups in which each subgroup contai

Consider the (p,q) simple connected graph . The sum absolute values of the spectrum of quotient matrix of a graph  make up the graph's quotient energy. The objective of this study is to examine the quotient energy of identity graphs and zero-divisor graphs  of commutative rings using group theory, graph theory, and applications. In this study, the identity graphs  derived from the group  and a few classes of zero-divisor graphs  of the commutative ring R are examined.

Antimagic labeling of a graph  with  vertices and  edges is assigned the labels for its edges by some integers from the set , such that no two edges received the same label, and the weights of vertices of a graph  are pairwise distinct. Where the vertex-weights of a vertex  under this labeling is the sum of labels of all edges incident to this vertex, in this paper, we deal with the problem of finding vertex antimagic edge labeling for some special families of graphs called strong face graphs. We prove that vertex antimagic, edge labeling for strong face ladder graph , strong face wheel graph ,  strong face fan graph , strong face prism graph  and finally strong face friendship graph .

The main objective of this study is to determine whether the use of He-Ne Laser (632.8 nm wavelength and power 0.5 mW) is an eligible and effective tool to kill or reduce the cell viability of Candida albicans isolated from complete upper dentures. Twenty one swabs were taken from the complete upper dentures. Only six swabs showed positive cultures for C. albicans. The isolate was divided into two groups, group I was not irradiated (control), and group II was irradiated by He-Ne Laser for different periods (10, 15, 20, and 30) min. After irradiation, the results showed a significant reduction in the viable cell count and colonies diameters especially at exposure periods 10 and 15 min. Although the low power He-Ne Laser was not eradicating t

This paper proves the existence of face antimagic labeling for double duplication of barycentric subdivision of cycle and some other graphs 

In this paper we have made different regular graphs by using block designs. In one of our applicable methods, first we have changed symmetric block designs into new block designs by using a method called a union method. Then we have made various regular graphs from each of them. For symmetric block designs with  (which is named finite projective geometry), this method leads to infinite class of regular graphs. With some examples we will show that these graphs can be strongly regular or semi-strongly regular. We have also propounded this conjecture that if two semi-symmetric block designs are non-isomorphic, then the resultant block graphs of them are non-isomorphic, too.

The metric dimension and dominating set are the concept of graph theory that can be developed in terms of the concept and its application in graph operations. One of some concepts in graph theory that combine these two concepts is resolving dominating number. In this paper, the definition of resolving dominating number is presented again as the term dominant metric dimension. The aims of this paper are to find the dominant metric dimension of some special graphs and corona product graphs of the connected graphs  and , for some special graphs  . The dominant metric dimension of  is denoted by  and the dominant metric dimension of corona product graph G and H is denoted by .

     The result involution graph of a finite group , denoted by  is an undirected simple graph whose vertex set is the whole group  and two distinct vertices are adjacent if their product is an involution element. In this paper, result involution graphs for all Mathieu groups and connectivity in the graph are studied. The diameter, radius and girth of this graph are also studied. Furthermore, several other graph properties are obtained.