<?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 Isfahan</PublisherName>
				<JournalTitle>International Journal of Group Theory</JournalTitle>
				<Issn>2251-7650</Issn>
				<Volume>7</Volume>
				<Issue>3</Issue>
				<PubDate PubStatus="epublish">
					<Year>2018</Year>
					<Month>09</Month>
					<Day>01</Day>
				</PubDate>
			</Journal>
<ArticleTitle>On nonsolvable groups whose prime degree graphs have four vertices and one triangle</ArticleTitle>
<VernacularTitle></VernacularTitle>
			<FirstPage>1</FirstPage>
			<LastPage>6</LastPage>
			<ELocationID EIdType="pii">21476</ELocationID>
			
<ELocationID EIdType="doi">10.22108/ijgt.2017.21476</ELocationID>
			
			<Language>EN</Language>
<AuthorList>
<Author>
					<FirstName>Roghayeh</FirstName>
					<LastName>Hafezieh</LastName>
<Affiliation>Department of‎ ‎Mathematics‎, ‎Gebze Technical University‎, ‎P.O.Box 41400, Gebze‎, ‎Turkey</Affiliation>

</Author>
</AuthorList>
				<PublicationType>Journal Article</PublicationType>
			<History>
				<PubDate PubStatus="received">
					<Year>2016</Year>
					<Month>12</Month>
					<Day>12</Day>
				</PubDate>
			</History>
		<Abstract>‎Let $G$ be a finite group‎. ‎The prime degree graph of $G$‎, ‎denoted‎ ‎by $\Delta(G)$‎, ‎is an undirected graph whose vertex set is $\rho(G)$ and there is an edge‎ ‎between two distinct primes $p$ and $q$ if and only if $pq$ divides some irreducible‎ ‎character degree of $G$‎. ‎In general‎, ‎it seems that the prime graphs‎ ‎contain many edges and thus they should have many triangles‎, ‎so one of the cases that would be interesting is to consider those finite groups whose prime degree graphs have a small number of triangles‎. ‎In this paper we consider the case where for a nonsolvable group $G$‎, ‎$\Delta(G)$ is a connected graph which has only one triangle and four vertices‎.</Abstract>
		<ObjectList>
			<Object Type="keyword">
			<Param Name="value">prime degree graph</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">irreducible character degree</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">triangle</Param>
			</Object>
		</ObjectList>
<ArchiveCopySource DocType="pdf">https://ijgt.ui.ac.ir/article_21476_7aa9bd067cc2235a1faa46dd8f4728af.pdf</ArchiveCopySource>
</Article>
</ArticleSet>
