<?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>Azarbaijan Shahid Madani University</PublisherName>
				<JournalTitle>Communications in Combinatorics and Optimization</JournalTitle>
				<Issn>2538-2128</Issn>
				<Volume>6</Volume>
				<Issue>1</Issue>
				<PubDate PubStatus="epublish">
					<Year>2021</Year>
					<Month>06</Month>
					<Day>01</Day>
				</PubDate>
			</Journal>
<ArticleTitle>Twin signed total Roman domatic numbers in digraphs</ArticleTitle>
<VernacularTitle></VernacularTitle>
			<FirstPage>17</FirstPage>
			<LastPage>26</LastPage>
			<ELocationID EIdType="pii">14024</ELocationID>
			
<ELocationID EIdType="doi">10.22049/cco.2020.26791.1142</ELocationID>
			
			<Language>EN</Language>
<AuthorList>
<Author>
					<FirstName>Jafar</FirstName>
					<LastName>Amjadi</LastName>
<Affiliation>Azarbaijan</Affiliation>

</Author>
</AuthorList>
				<PublicationType>Journal Article</PublicationType>
			<History>
				<PubDate PubStatus="received">
					<Year>2019</Year>
					<Month>01</Month>
					<Day>09</Day>
				</PubDate>
			</History>
		<Abstract>Let $D$ be a finite simple digraph with vertex set $V(D)$ and arc set $A(D)$. A twin signed total Roman dominating function (TSTRDF) on the digraph $D$ is a function $f:V(D)\rightarrow\{-1,1,2\}$ satisfying the conditions that (i) $\sum_{x\in N^-(v)}f(x)\ge 1$ and $\sum_{x\in N^+(v)}f(x)\ge 1$ for each $v\in V(D)$, where $N^-(v)$ (resp. $N^+(v)$) consists of all in-neighbors (resp. out-neighbors) of $v$, and (ii) every vertex $u$ for which $f(u)=-1$ has an in-neighbor $v$ and an out-neighbor $w$ with $f(v)=f(w)=2$. A set $\{f_1,f_2,\ldots,f_d\}$ of distinct twin signed total Roman dominating functions on $D$ with the property that $\sum_{i=1}^df_i(v)\le 1$ for each $v\in V(D)$, is called a twin signed total Roman dominating family (of functions) on $D$. The maximum number of functions in a twin signed total Roman dominating family on $D$ is the twin signed total Roman domatic number of $D$, denoted by $d_{stR}^*(D)$. In this paper, we initiate the study of the twin signed total Roman domatic number in digraphs and present some sharp bounds on $d_{stR}^*(D)$. In addition, we determine the twin signed total Roman domatic number of some classes of digraphs.</Abstract>
		<ObjectList>
			<Object Type="keyword">
			<Param Name="value">twin signed total Roman dominating function</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">twin signed total Roman domination number</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">twin signed total Roman domatic number</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Directed graph</Param>
			</Object>
		</ObjectList>
<ArchiveCopySource DocType="pdf">https://comb-opt.azaruniv.ac.ir/article_14024_cb9f88cbfb5b432cda02cb7e1cf7e573.pdf</ArchiveCopySource>
</Article>
</ArticleSet>
