<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE ArticleSet PUBLIC "-//NLM//DTD PubMed 2.6//EN" "http://www.ncbi.nlm.nih.gov/corehtml/query/static/PubMed.dtd">
<ArticleSet>
<Article>
<Journal>
				<PublisherName>Iranian Mathematical Society (IMS)</PublisherName>
				<JournalTitle>Bulletin of the Iranian Mathematical Society</JournalTitle>
				<Issn>1017-060X</Issn>
				<Volume>37</Volume>
				<Issue>No. 3</Issue>
				<PubDate PubStatus="epublish">
					<Year>2011</Year>
					<Month>03</Month>
					<Day>15</Day>
				</PubDate>
			</Journal>
<ArticleTitle>Linear Sphericity Testing of 3-Connected Single Source Digraphs</ArticleTitle><FirstPage>291</FirstPage>
			<LastPage>304</LastPage>
			<Language>en</Language>
<AuthorList>
<Author>
					<FirstName>A. </FirstName>
					<LastName>Dolati</LastName>
					<Affiliation></Affiliation>
				</Author>
</AuthorList>
			<History>
				<PubDate PubStatus="received">
					<Year>2009</Year>
					<Month>05</Month>
					<Day>31</Day>
				</PubDate>
			</History>
		<Abstract><![CDATA[It has been proved that sphericity testing for digraphs is an
NP-complete problem. Here, we
investigate sphericity of 3-connected single source digraphs. We
provide a new combinatorial characterization of sphericity and give
a linear time algorithm for sphericity testing. Our algorithm tests
whether a 3-connected single source digraph with $n$ vertices is
spherical in $O(n)$ time.]]></Abstract>
		<ObjectList>
			<Object Type="keyword">
			<Param Name="value">Embedding</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">upward embedding</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">sphericity</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">single
source digraph</Param>
			</Object>
		</ObjectList>
</Article>
</ArticleSet>