The algebraic properties of a group can be explored through the relationship among its elements. In this paper, we define the graph that establishes a systematic relationship among the group elements. Let G be a finite group, the order product prime graph of a group G, is a graph having the elements of G as its vertices and two vertices are adjacent if and only if the product of their order is a prime power. We give the general presentation for the graph on dihedral groups and cyclic groups and classify finite dihedral groups and cyclic groups in terms of the order product prime graphs as one of connected, complete, regular and planar. We also obtained some invariants of the graph such as its diameter, girth,independent number and the clique number. Furthermore, we used thevertex-cut of the graph in determining the nilpotency status of dihedralgroups. The graph on dihedral groups is proven to be regular and complete only if the degree of the corresponding group is even prime power and connected for all prime power degree. It is also proven on cyclic groups to be both regular, complete and connected if the group has prime power order. Additionally, the result turn out to show that any dihedral group whose order product prime graph’s vertex-cut is greater than one is nilpotent. We also show that the order product prime graph is planar only when the degree of the group is three for dihedral groups and less than five for cyclic groups. Our final result shows that the order product prime graphs of any two isomorphic groups are isomophic.
A topological index is a number generated from a molecular structure that signifies the molecule’s fundamental structural characteristics. This correlation between the index and various physical attributes is based on an algebraic quantity related to the chemical structure. Many topological indices, such as the Wiener index, first and second Zagreb indices, can be employed to determine various properties, including chemical activity, thermodynamic properties, physicochemical activity, and biological activity. Meanwhile, the p-subgroup graph of a group G is defined as a graph whose vertices represent the elements of the group, and two vertices are adjacent if and only if the order of the subgroup is a prime power. The main objective of this paper is to establish the general formula for certain topological indices, specifically the Wiener index, first Zagreb index, and second Zagreb index for the -subgroup graph associated with dihedral groups.
The coprime probability and graph have been studied for various groups by many researchers focusing on the generalization of the probability part. For the coprime graph, the types and properties of the graph have been investigated and the patterns that can be found within a group are analysed. The coprime probability of a group is defined as the probability that the order of a random pair of elements in the group are relatively prime or coprime. Meanwhile, the coprime graph can be explained as a graph whose vertices are elements of a group and two distinct vertices are adjacent if and only if the greatest common divisor of the order of the first vertex and order of the second vertex is equal to one. It was unfortunate that the exploration of probabilities and graphs of groups have not considered both then-th coprime probability and its graph that ultimately became the target in this research. Hence, the newly defined terms are then used to find the generalizations of then-th coprime probability and then-th coprime graphs for some dihedral groups. The types and properties of the graphs are also discussed in this research.