Twin g-noncommuting graph of a finite group

Siti Zahidah, Karine Lutfiah Oktaviana, Yayuk Wahyuni, Liliek Susilowati, Ahmad Erfanian

Research output: Contribution to journalArticlepeer-review

Abstract

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

Original languageEnglish
Pages (from-to)287-295
Number of pages9
JournalAKCE International Journal of Graphs and Combinatorics
Volume19
Issue number3
DOIs
Publication statusPublished - 2022

Keywords

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

Fingerprint

Dive into the research topics of 'Twin g-noncommuting graph of a finite group'. Together they form a unique fingerprint.

Cite this