<?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>5</Volume>
				<Issue>2</Issue>
				<PubDate PubStatus="epublish">
					<Year>2016</Year>
					<Month>06</Month>
					<Day>01</Day>
				</PubDate>
			</Journal>
<ArticleTitle>Finite BCI-groups are solvable</ArticleTitle>
<VernacularTitle></VernacularTitle>
			<FirstPage>1</FirstPage>
			<LastPage>6</LastPage>
			<ELocationID EIdType="pii">7265</ELocationID>
			
<ELocationID EIdType="doi">10.22108/ijgt.2016.7265</ELocationID>
			
			<Language>EN</Language>
<AuthorList>
<Author>
					<FirstName>Majid</FirstName>
					<LastName>Arezoomand</LastName>
<Affiliation>Isfahan University of Technology</Affiliation>

</Author>
<Author>
					<FirstName>Bijan</FirstName>
					<LastName>Taeri</LastName>
<Affiliation>Isfahan University of Technology</Affiliation>

</Author>
</AuthorList>
				<PublicationType>Journal Article</PublicationType>
			<History>
				<PubDate PubStatus="received">
					<Year>2014</Year>
					<Month>04</Month>
					<Day>11</Day>
				</PubDate>
			</History>
		<Abstract>Let $S$ be a subset of a finite group $G$‎. ‎The bi-Cayley graph $BCay(G,S)$ of $G$ with respect to $S$ is an undirected graph with vertex set $G\times\{1,2\}$ and edge set $\{\{(x,1),(sx,2)\}\mid x\in G‎, ‎\ s\in S\}$‎. ‎A bi-Cayley graph $BCay(G,S)$ is called a BCI-graph if for any bi-Cayley graph $BCay(G,T)$‎, ‎whenever $BCay(G,S)\cong BCay(G,T)$ we have $T=gS^\alpha$ for some $g\in G$ and $\alpha\in Aut(G)$‎. ‎A group $G$ is called a BCI-group if every bi-Cayley graph of $G$ is a BCI-graph‎. ‎In this paper‎, ‎we prove that every BCI-group is solvable‎.</Abstract>
		<ObjectList>
			<Object Type="keyword">
			<Param Name="value">Bi-Cayley graph‎</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">‎graph isomorphism‎</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">‎solvable group</Param>
			</Object>
		</ObjectList>
<ArchiveCopySource DocType="pdf">https://ijgt.ui.ac.ir/article_7265_5d7f9ab8bf8b6c396bfac5b1e7a5f461.pdf</ArchiveCopySource>
</Article>
</ArticleSet>
