On diameter of subgraphs of commuting graph in symplectic group for elements of order three

Suppose G be a finite group and X be a subset of G. The commuting graph, denoted by C(G,X), is a simple undirected graph, where X ⊂ G being the set of vertex and two distinct vertices x,y ∈ X are joined by an edge if and only if xy = yx. The aim of this paper was to describe the structure of disconn...

Full description

Saved in:
Bibliographic Details
Main Authors: Suzila Mohd Kasim,, Athirah Nawawi,
Format: Article
Language:English
Published: Penerbit Universiti Kebangsaan Malaysia 2021
Online Access:http://journalarticle.ukm.my/16512/1/25.pdf
http://journalarticle.ukm.my/16512/
https://www.ukm.my/jsm/malay_journals/jilid50bil2_2021/KandunganJilid50Bil2_2021.html
Tags: Add Tag
No Tags, Be the first to tag this record!