Conditions on the Edges and Vertices of Non-commuting Graph
DOI:
https://doi.org/10.11113/jt.v74.1964Keywords:
Finite group, non-commuting graphAbstract
Abstract - Let G􀡳 be a non- abelian finite group. The non-commuting graph ,􀪡is defined as a graph with a vertex set􀡳 − G-Z(G)􀢆in which two vertices x􀢞 and y􀢟 are joined if and only if xy􀢞􀢟 ≠yx􀢟􀢞.  In this paper, we invest some results on the number of edges set , the degree of avertex of non-commuting graph and the number of conjugacy classes of a finite group. In order that if 􀪡􀡳non-commuting graph of H ≅ non - commuting graph of G􀪡􀡴,H 􀡴 is afinite group, then |G􀡳| = |H􀡴| .References
Abdollahi, A., S. Akbari and H. R. Maimani. 2006. Non-Commuting Graph of a Group. J. Algebra. 298: 468–492.
Bondy, J. A and J. S. Murty. 1977. Graph Theory with Applications. American Elsevier Publishing Co, Inc.
Gustafson, W. H. 1973. What is the Probability That Two Group Elements Commute? The American Mathematical Monthly. 80(9): 1031–1034.
Neuman, B. H. 1976. Problem of Paul EdrÄos on Groups. J. Austral. Math.Soc. 21: 467–472.
Downloads
Published
Issue
Section
License
Copyright of articles that appear in Jurnal Teknologi belongs exclusively to Penerbit Universiti Teknologi Malaysia (Penerbit UTM Press). This copyright covers the rights to reproduce the article, including reprints, electronic reproductions, or any other reproductions of similar nature.