<?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>3</Volume>
				<Issue>3</Issue>
				<PubDate PubStatus="epublish">
					<Year>2014</Year>
					<Month>09</Month>
					<Day>01</Day>
				</PubDate>
			</Journal>
<ArticleTitle>Minimum flows in the total graph of a finite commutative ring</ArticleTitle>
<VernacularTitle></VernacularTitle>
			<FirstPage>11</FirstPage>
			<LastPage>20</LastPage>
			<ELocationID EIdType="pii">5252</ELocationID>
			
<ELocationID EIdType="doi">10.22108/toc.2014.5252</ELocationID>
			
			<Language>EN</Language>
<AuthorList>
<Author>
					<FirstName>Torsten</FirstName>
					<LastName>Sander</LastName>
<Affiliation>Ostfalia Hochschule fur Angewandte Wissenschaften</Affiliation>

</Author>
<Author>
					<FirstName>Khalida Mohammad</FirstName>
					<LastName>Nazzal</LastName>
<Affiliation>Palestine Technical University</Affiliation>

</Author>
</AuthorList>
				<PublicationType>Journal Article</PublicationType>
			<History>
				<PubDate PubStatus="received">
					<Year>2013</Year>
					<Month>06</Month>
					<Day>03</Day>
				</PubDate>
			</History>
		<Abstract>Let $R$ be a commutative ring with zero-divisor set $Z(R)$‎. ‎The total graph of $R$‎, ‎denoted by‎ ‎$T(\Gamma(R))$‎, ‎is the simple (undirected) graph with vertex set $R$ where two distinct vertices are‎ ‎adjacent if their sum lies in $Z(R)$‎. ‎This work considers minimum zero-sum $k$-flows for $T(\Gamma(R))$‎. ‎Both for $\vert R\vert$ even and the case when $\vert R\vert$ is odd and $Z(G)$ is an ideal of $R$‎ ‎it is shown that $T(\Gamma(R))$ has a zero-sum $3$-flow‎, ‎but no zero-sum $2$-flow‎. ‎As a step towards resolving the remaining case‎, ‎the total graph $T(\Gamma(\mathbb{Z}_n ))$‎ ‎for the ring of integers modulo $n$ is considered‎. ‎Here‎, ‎minimum zero-sum $k$-flows are obtained for $n = p^r$ and $n = p^r q^s$ (where $p$‎ ‎and $q$ are primes‎, ‎$r$ and $s$ are positive integers)‎. ‎Minimum zero-sum $k$-flows‎ ‎as well as minimum constant-sum $k$-flows in regular graphs are also investigated‎.</Abstract>
		<ObjectList>
			<Object Type="keyword">
			<Param Name="value">Constant-sum k-flow</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">minimum flow</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">the ring of integers modulo n</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">total graph of a commutative ring</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">zero-sum k-flow</Param>
			</Object>
		</ObjectList>
<ArchiveCopySource DocType="pdf">https://toc.ui.ac.ir/article_5252_34bd2a18fa39bc58c69e5a7037b0e84c.pdf</ArchiveCopySource>
</Article>
</ArticleSet>
