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...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Penerbit Universiti Kebangsaan Malaysia
2021
|
| Online Access: | http://journalarticle.ukm.my/16512/ http://journalarticle.ukm.my/16512/1/25.pdf |