<?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>4</Volume>
				<Issue>1</Issue>
				<PubDate PubStatus="epublish">
					<Year>2015</Year>
					<Month>03</Month>
					<Day>01</Day>
				</PubDate>
			</Journal>
<ArticleTitle>Optimal orientations of subgraphs of complete bipartite graphs</ArticleTitle>
<VernacularTitle></VernacularTitle>
			<FirstPage>19</FirstPage>
			<LastPage>29</LastPage>
			<ELocationID EIdType="pii">4725</ELocationID>
			
<ELocationID EIdType="doi">10.22108/toc.2015.4725</ELocationID>
			
			<Language>EN</Language>
<AuthorList>
<Author>
					<FirstName>R.</FirstName>
					<LastName>Lakshmi</LastName>
<Affiliation>Assistant Professor
Department of mathematics
Annamalai University
Annamalainagar 608002</Affiliation>

</Author>
<Author>
					<FirstName>G.</FirstName>
					<LastName>Rajasekaran</LastName>
<Affiliation>Research Scholar,
Department of Mathematics,
Annamalai University,
Annamalainagar 608 002</Affiliation>

</Author>
<Author>
					<FirstName>R.</FirstName>
					<LastName>Sampathkumar</LastName>
<Affiliation>Mathematics Section,
FEAT, Annamalai University
Annamalainagar 6008002</Affiliation>

</Author>
</AuthorList>
				<PublicationType>Journal Article</PublicationType>
			<History>
				<PubDate PubStatus="received">
					<Year>2013</Year>
					<Month>09</Month>
					<Day>13</Day>
				</PubDate>
			</History>
		<Abstract>For a graph $G,$ let $\mathscr{D}(G)$ be the set of all strong digraphs $D$ obtained by the orientations of $G.$ The &lt;em&gt;orientation number&lt;/em&gt; of $G$ is $\stackrel{\rightarrow}{d}\!\!(G)\,=$ min $\{d(D)\,|\,D\,\in\,\mathscr{D}(G)\},$ where $d(D)$ denotes the diameter of the digraph $D.$ In this paper‎, ‎we determine the orientation number for some subgraphs of complete bipartite graphs‎.</Abstract>
		<ObjectList>
			<Object Type="keyword">
			<Param Name="value">subgraphs of complete bipartite graphs</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">orientation</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">orientation number</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">$Z_2^n$-partition</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">$Z_2^n$-set</Param>
			</Object>
		</ObjectList>
<ArchiveCopySource DocType="pdf">https://toc.ui.ac.ir/article_4725_ab6061f1b408a4d9a9b58cff4bb6771c.pdf</ArchiveCopySource>
</Article>
</ArticleSet>
