<?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>Transactions on Combinatorics</JournalTitle>
				<Issn>2251-8657</Issn>
				<Volume>5</Volume>
				<Issue>2</Issue>
				<PubDate PubStatus="epublish">
					<Year>2016</Year>
					<Month>06</Month>
					<Day>01</Day>
				</PubDate>
			</Journal>
<ArticleTitle>On the spectrum of $r$-orthogonal Latin squares of different orders</ArticleTitle>
<VernacularTitle></VernacularTitle>
			<FirstPage>41</FirstPage>
			<LastPage>51</LastPage>
			<ELocationID EIdType="pii">11665</ELocationID>
			
<ELocationID EIdType="doi">10.22108/toc.2016.11665</ELocationID>
			
			<Language>EN</Language>
<AuthorList>
<Author>
					<FirstName>Hanieh</FirstName>
					<LastName>Amjadi</LastName>
<Affiliation>Alzahra University</Affiliation>

</Author>
<Author>
					<FirstName>Nasrin</FirstName>
					<LastName>Soltankhah</LastName>
<Affiliation>Alzahra University</Affiliation>

</Author>
<Author>
					<FirstName>Naji</FirstName>
					<LastName>Shajarisales</LastName>
<Affiliation>Max Planck Institute for Intelligent Systems</Affiliation>

</Author>
<Author>
					<FirstName>Mehrdad</FirstName>
					<LastName>Tahvilian</LastName>
<Affiliation>Sharif University of Technology</Affiliation>

</Author>
</AuthorList>
				<PublicationType>Journal Article</PublicationType>
			<History>
				<PubDate PubStatus="received">
					<Year>2015</Year>
					<Month>04</Month>
					<Day>27</Day>
				</PubDate>
			</History>
		<Abstract>‎Two Latin squares of order $n$ are orthogonal if in their superposition‎, ‎each of the $n^{2}$ ordered pairs of symbols occurs exactly once‎. ‎Colbourn‎, ‎Zhang and Zhu‎, ‎in a series of papers‎, ‎determined the integers $r$ for which there exist a pair of Latin squares of order $n$ having exactly $r$ different ordered pairs in their superposition‎. ‎Dukes and Howell defined the same problem for Latin squares of different orders $n$ and $n+k$‎. ‎They obtained a non-trivial lower bound for $r$ and solved the problem for $k \geq \frac{2n}{3} $‎. ‎Here for $k &lt; \frac{2n}{3}$‎, ‎some constructions are shown to realize many values of $r$ and for small cases $(3\leq n \leq 6)$‎, ‎the problem has been solved‎.</Abstract>
		<ObjectList>
			<Object Type="keyword">
			<Param Name="value">‎Latin square‎</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">‎Orthogonal Latin square‎</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">‎$‎‎r‎$‎-Orthogonal Latin square‎</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">‎$‎‎r‎$‎-Orthogonality spectrum‎</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">‎Transversal</Param>
			</Object>
		</ObjectList>
<ArchiveCopySource DocType="pdf">https://toc.ui.ac.ir/article_11665_93148cb85b3fdaf4b4abfe8412331040.pdf</ArchiveCopySource>
</Article>
</ArticleSet>
