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.
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.
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.
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.
In 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.