Let G be a finite group, the result is the involution graph of G, which is an undirected simple graph denoted by the group G as the vertex set and x, y ∈ G adjacent if xy and (xy)2 = 1. In this article, we investigate certain properties of G, the Leech lattice groups HS and McL. The study involves calculating the diameter, the radius, and the girth of ΓGRI.
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.
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
... Show MoreIn a connected graph , the distance function between each pair of two vertices from a set vertex is the shortest distance between them and the vertex degree denoted by is the number of edges which are incident to the vertex The Schultz and modified Schultz polynomials of are have defined as:
respectively, where the summations are taken over all unordered pairs of distinct vertices in and is the distance between and in The general forms of Schultz and modified Schultz polynomials shall be found and indices of the edge – identification chain and ring – square graphs in the present work.