<?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>Amirkabir University of Technology</PublisherName>
				<JournalTitle>AUT Journal of Mathematics and Computing</JournalTitle>
				<Issn>2783-2449</Issn>
				<Volume>1</Volume>
				<Issue>2</Issue>
				<PubDate PubStatus="epublish">
					<Year>2020</Year>
					<Month>09</Month>
					<Day>01</Day>
				</PubDate>
			</Journal>
<ArticleTitle>A linear-time algorithm to compute total $[1,2]$-domination number of block graphs</ArticleTitle>
<VernacularTitle></VernacularTitle>
			<FirstPage>263</FirstPage>
			<LastPage>270</LastPage>
			<ELocationID EIdType="pii">4029</ELocationID>
			
<ELocationID EIdType="doi">10.22060/ajmc.2020.18444.1035</ELocationID>
			
			<Language>EN</Language>
<AuthorList>
<Author>
					<FirstName>Pouyeh</FirstName>
					<LastName>Sharifani</LastName>

						<AffiliationInfo>
						<Affiliation>Institute for Research in Fundamental Sciences (IPM), Tehran, Iran</Affiliation>
						</AffiliationInfo>

						<AffiliationInfo>
						<Affiliation>Department of Computer Science, Yazd University, Yazd, Iran</Affiliation>
						</AffiliationInfo>

</Author>
<Author>
					<FirstName>Mohammadreza</FirstName>
					<LastName>Hooshmandasl</LastName>

						<AffiliationInfo>
						<Affiliation>Department of Computer Science, University of Mohaghegh Ardabili, Ardabil, Iran</Affiliation>
						</AffiliationInfo>

						<AffiliationInfo>
						<Affiliation>Department of Computer Science, Yazd University, Yazd, Iran</Affiliation>
						</AffiliationInfo>
<Identifier Source="ORCID">0000-0002-3834-3610</Identifier>

</Author>
<Author>
					<FirstName>Saeid</FirstName>
					<LastName>Alikhani</LastName>
<Affiliation>Department of Mathematics, Yazd University, Yazd, Iran</Affiliation>

</Author>
</AuthorList>
				<PublicationType>Journal Article</PublicationType>
			<History>
				<PubDate PubStatus="received">
					<Year>2020</Year>
					<Month>05</Month>
					<Day>19</Day>
				</PubDate>
			</History>
		    <Abstract>Let $G=(V, E)$ be a simple graph without isolated vertices. A set $D\subseteq V$ is a total $[1,2]$-dominating set if for every vertex $v\in V , 1\leq |N(v)\cap D|\leq 2$. The total $[1,2]$-domination problem is to determine the total $[1,2]$-domination number $\gamma_{t[1,2]}(G)$, which is the minimum cardinality of a total $[1,2]$-dominating set for a graph $G$. In this paper, we present a linear-time algorithm to compute $\gamma_{t[1,2]}(G)$, for a block graph $G$.</Abstract>
		<ObjectList>
			<Object Type="keyword">
			<Param Name="value">Total $[1,2]$-set</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Dominating set</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Block graph</Param>
			</Object>
		</ObjectList>
<ArchiveCopySource DocType="pdf">https://ajmc.aut.ac.ir/article_4029_015e31933548461020e2ba448e85995e.pdf</ArchiveCopySource>
</Article>
</ArticleSet>
