<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE ArticleSet PUBLIC "-//NLM//DTD PubMed 2.7//EN" "https://dtd.nlm.nih.gov/ncbi/pubmed/in/PubMed.dtd">
<ArticleSet>
<Article>
<Journal>
				<PublisherName>University of Tehran</PublisherName>
				<JournalTitle>Journal of Sciences, Islamic Republic of Iran</JournalTitle>
				<Issn>1016-1104</Issn>
				<Volume>25</Volume>
				<Issue>4</Issue>
				<PubDate PubStatus="epublish">
					<Year>2014</Year>
					<Month>12</Month>
					<Day>01</Day>
				</PubDate>
			</Journal>
<ArticleTitle>A Kind of Non-commuting Graph of Finite Groups</ArticleTitle>
<VernacularTitle></VernacularTitle>
			<FirstPage>379</FirstPage>
			<LastPage>384</LastPage>
			<ELocationID EIdType="pii">52625</ELocationID>
			
			
			<Language>EN</Language>
<AuthorList>
<Author>
					<FirstName>B.</FirstName>
					<LastName>Tolue</LastName>
<Affiliation>1Department of Pure Mathematics, Faculty of Sciences, Hakim Sabzevari University, Sabzevar, Islamic republic of  Iran</Affiliation>

</Author>
<Author>
					<FirstName>A.</FirstName>
					<LastName>Erfanian</LastName>
<Affiliation>2 Department of Mathematics and Center of Excellence in Analysis on Algebraic Structures, Faculty of Sciences, Ferdowsi University of Mashhad, Mashhad, Islamic republic of Iran.</Affiliation>

</Author>
<Author>
					<FirstName>A.</FirstName>
					<LastName>Jafarzadeh</LastName>
<Affiliation>2 Department of Mathematics and Center of Excellence in Analysis on Algebraic Structures, Faculty of Sciences, Ferdowsi University of Mashhad, Mashhad, Islamic republic of Iran.</Affiliation>

</Author>
</AuthorList>
				<PublicationType>Journal Article</PublicationType>
			<History>
				<PubDate PubStatus="received">
					<Year>2013</Year>
					<Month>10</Month>
					<Day>28</Day>
				</PubDate>
			</History>
		<Abstract>Let g be a fixed element of a finite group G. We introduce the g-noncommuting graph of G whose vertex set is whole elements of the group G and two vertices x,y are adjacent whenever [x,y] g  and  [y,x] g. We denote this graph by . In this paper, we present some graph theoretical properties of g-noncommuting graph. Specially, we investigate about its planarity and regularity, its clique number and dominating number. We prove that if G, H are isoclinic groups with |Z (G)|=|Z (H)|, then their associated graphs are isomorphic.</Abstract>
		<ObjectList>
			<Object Type="keyword">
			<Param Name="value">g-noncommuting graph</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">commutator</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">non-commuting graph</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">isoclinism</Param>
			</Object>
		</ObjectList>
<ArchiveCopySource DocType="pdf">https://jsciences.ut.ac.ir/article_52625_d10ebf26020ddfc9803c7628524add3d.pdf</ArchiveCopySource>
</Article>
</ArticleSet>
