he genus Hirudo is an invertebrate animal that got major concerns to human. However, genetics of Hirudo has been unwell considered in Iraq. In order to gain a deeper understanding in the outline of the genetic of Hirudo that were used in alternative medicine clinics, nineteen specimens of Hirudo were obtained. Fourteen of them (H.verbana, n=10; H. orientalis, n=4) were obtained from some different clinics and scientific centres in Baghdad, Iraq between January and March 2022, these specimens were considered as non-local leeches. The other (native isolates) leeches (H. orientalis, n=5) were collected in 2014 from two localities in Erbil, northern Iraq. ITS-2, COI and 12S-rRNA of Hirudo spp were amplified using conventional polymerase chain r

A factor group is a mathematical group obtained by aggregating similar elements of a larger group using an equivalence relation that preserves some of the group structure. In this paper, the factor groups K(SL(2,121)) and K(SL(2,169)) computed for each group from the character table of rational representations.

The group for the multiplication of closets is the set G|N of all closets of N in G, if G is a group and N is a normal subgroup of G. The term “G by N factor group” describes this set. In the quotient group G|N, N is the identity element. In this paper, we procure K(SL(2,125)) and K(SL(2,3125)) from the character table of rational representations for each group.

For any group G, we define G/H (read” G mod H”) to be the set of left cosets of H in G and this set forms a group under the operation (a)(bH) = abH. The character table of rational representations study to gain the K( SL(2,81)) and K( SL(2, 729)) in this work.

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 .