A domination polynomial is a type of graph polynomial in which its coefficients represent the number of dominating sets in the graph. There are many researches being done on the domination polynomial of some common types of graphs but not yet for graphs associated to finite groups. Two types of graphs associated to finite groups are the conjugate graph and the conjugacy class graph. A graph of a group G is called a conjugate graph if the vertices are non-central elements of G and two distinct vertices are adjacent if they are conjugate to each other. Meanwhile, a conjugacy class graph of a group G is a graph in which its vertices are the non-central conjugacy classes of G and two distinct vertices are connected if and only if their class cardinalities are not coprime. The conjugate and conjugacy class graph of dihedral groups can be expressed generally as a union of complete graphs on some vertices. In this paper, the domination polynomials are computed for the conjugate and conjugacy class graphs of the dihedral groups.
Topological indices are numerical values that can be analysed to predict the chemical properties of the molecular structure and the topological indices are computed for a graph related to groups. Meanwhile, the conjugacy class graph of is defined as a graph with a vertex set represented by the non-central conjugacy classes of . Two distinct vertices are connected if they have a common prime divisor. The main objective of this article is to find various topological indices including the Wiener index, the first Zagreb index and the second Zagreb index for the conjugacy class graph of dihedral groups of order where the dihedral group is the group of symmetries of regular polygon, which includes rotations and reflections. Many topological indices have been determined for simple and connected graphs in general but not graphs related to groups. In this article, the Wiener index and Zagreb index of conjugacy class graph of dihedral groups are generalized.
Let g be a finite group and s be a subset of g, where s does not include
the identity of g and is inverse closed. A cayley graph of a group g with respect to the
subset s is a graph, where its vertices are the elements of g and two vertices a and b
are connected if ab-1 is in the subset s. The energy of a cayley graph is the sum of all
absolute values of the eigenvalues of its adjacency matrix. In this paper, we consider a
specific subset s = {b, ab, . . . , An-1b} for dihedral groups of order 2n, where n 3 and find
the cayley graph with respect to the set. We also calculate the eigenvalues and compute
the energy of the respected cayley graphs. Finally, the generalization of the energy of the
respected cayley graphs is found.
Let G be a dihedral group and ??cl G its conjugacy class graph. The Laplacian energy of the graph, LE(??cl G) is defined as the sum of the absolute values of the difference between the Laplacian eigenvalues and the ratio of twice the edges number divided by the vertices number. In this research, the Laplacian matrices of the conjugacy class graph of some dihedral groups, generalized quaternion groups, quasidihedral groups and their eigenvalues are first computed. Then, the Laplacian energy of the graphs are determined.