SOME RESULTS ON CHARACTERIZATION OF FINITE GROUPS BY NON-COMMUTING GRAPH

Q: How can I download an article?

To download an article from SID, first log in to the site, search for the article title, and click on the 'Download Article' option.

Q: How can I download an ISI article?

To download an ISI article on SID, enter the keyword or article title in the search bar, view the relevant results, click on the desired article, and select the 'Download Article' option.

Q: How can I access the SID database?

To access the SID database, visit SID.ir, create an account, and log in to access scientific resources.

Q: Is downloading articles from SID free?

Some articles on SID are available for free, while others require payment. Details are specified on the article's page.

DARAFSHEH M.R.; YOUSEFZADEH PEDRAM

Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Journal Paper

Paper Information

Journal: TRANSACTIONS ON COMBINATORICS Year:2012 | Volume:1 | Issue:2 Page(s): 41-48

Download Full-Text

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Persian Verion

View:

665

Download:

147

Cites:

Information Journal Paper

Title

SOME RESULTS ON CHARACTERIZATION OF FINITE GROUPS BY NON-COMMUTING GRAPH

Author(s)

DARAFSHEH M.R. | YOUSEFZADEH PEDRAM | Issue Writer Certificate

Keywords

NON COMMUTING GRAPHQ2

NILPOTENT GROUPSQ2

NITE GROUPSQ2

Abstract

The NON COMMUTING GRAPHr Ñ(G) of a non-abelian fnite group G is defined as follows: its vertex set is G - Z (G) and two distinct vertices x and y are joined by an edge if and only if the commutator of x and y is not the identity. In this paper we prove some new results about this graph. In particular we will give a new proof of Theorem 3.24 of [A. Abdollahi, S. Akbari, H. R, Maimani, Non-commuting graph of a group, J. Algebra, 298 (2006) 468-492.]. We also prove that if G1; G2;…; Gn are finite groups such that Z (Gi) =1 for i=1; 2;… ; n and they are characterizable by NON COMMUTING GRAPH, then G1xG2x…xGn is characterizable by non-commuting graph.

Cites

No record.

References

No record.

Cite

APA: Copy

DARAFSHEH, M.R., & YOUSEFZADEH, PEDRAM. (2012). SOME RESULTS ON CHARACTERIZATION OF FINITE GROUPS BY NON-COMMUTING GRAPH. TRANSACTIONS ON COMBINATORICS, 1(2), 41-48. SID. https://sid.ir/paper/213771/en

Vancouver: Copy

DARAFSHEH M.R., YOUSEFZADEH PEDRAM. SOME RESULTS ON CHARACTERIZATION OF FINITE GROUPS BY NON-COMMUTING GRAPH. TRANSACTIONS ON COMBINATORICS[Internet]. 2012;1(2):41-48. Available from: https://sid.ir/paper/213771/en

IEEE: Copy

M.R. DARAFSHEH, and PEDRAM YOUSEFZADEH, “SOME RESULTS ON CHARACTERIZATION OF FINITE GROUPS BY NON-COMMUTING GRAPH,” TRANSACTIONS ON COMBINATORICS, vol. 1, no. 2, pp. 41–48, 2012, [Online]. Available: https://sid.ir/paper/213771/en

Related Journal Papers