Twin g-noncommuting graph of a finite group

Abstract

AbstractIn this paper, we introduce the twin g-noncommuting graph of a finite group that is developed by combining the concepts of the g-noncommuting graph and the twin noncommuting graph of a finite group. The twin g-noncommuting graph of a finite group G, denoted by [Formula: see text] is constructed by considering the twin vertex set as one vertex and the adjacency of the two vertices are determined from their adjacency on the g-noncommuting graph. Furthermore, we choose dihedral group, whose representation of the twin g-noncommuting graph is determined. In addition, we determine the clique number of the twin g-noncommuting graph of dihedral group.

Keywords

• g-noncommuting graph
• twin noncommuting graph
• twin g-noncommuting graph
• dihedral group
• clique number
• 05C25