<?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 Tehran Press</PublisherName>
				<JournalTitle>Journal of Algorithms and Computation</JournalTitle>
				<Issn>2476-2776</Issn>
				<Volume>47</Volume>
				<Issue>1</Issue>
				<PubDate PubStatus="epublish">
					<Year>2016</Year>
					<Month>05</Month>
					<Day>21</Day>
				</PubDate>
			</Journal>
<ArticleTitle>Minimum Tenacity of Toroidal graphs</ArticleTitle>
<VernacularTitle></VernacularTitle>
			<FirstPage>127</FirstPage>
			<LastPage>135</LastPage>
			<ELocationID EIdType="pii">7951</ELocationID>
			
<ELocationID EIdType="doi">10.22059/jac.2016.7951</ELocationID>
			
			<Language>EN</Language>
<AuthorList>
<Author>
					<FirstName>Hamid</FirstName>
					<LastName>Doost Hosseini</LastName>
<Affiliation>University of Tehran, College of Engineering, School of Civil Engineering</Affiliation>

</Author>
</AuthorList>
				<PublicationType>Journal Article</PublicationType>
			<History>
				<PubDate PubStatus="received">
					<Year>2015</Year>
					<Month>04</Month>
					<Day>30</Day>
				</PubDate>
			</History>
		    <Abstract>The tenacity of a graph G, T(G), is dened by T(G) = min{[|S|+τ(G-S)]/[ω(G-S)]}, where the minimum is taken over all vertex cutsets S of G. We dene τ(G - S) to be the number of the vertices in the largest component of the graph G - S, and ω(G - S) be the number of components of G - S.In this paper a lower bound for the tenacity T(G) of a graph with genus γ(G) is obtained using the graph&#039;s connectivity κ(G). Then we show that such a bound for almost all toroidal graphs is best possible.</Abstract>
		<ObjectList>
			<Object Type="keyword">
			<Param Name="value">genus</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">graph's connectivity</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">toroidal graphs</Param>
			</Object>
		</ObjectList>
<ArchiveCopySource DocType="pdf">https://jac.ut.ac.ir/article_7951_416e5cf0acb7e553a880b7647903da6e.pdf</ArchiveCopySource>
</Article>
</ArticleSet>
