<?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>9</Volume>
				<Issue>2</Issue>
				<PubDate PubStatus="epublish">
					<Year>2024</Year>
					<Month>06</Month>
					<Day>01</Day>
				</PubDate>
			</Journal>
<ArticleTitle>Signed total Italian $k$-domination in digraphs</ArticleTitle>
<VernacularTitle></VernacularTitle>
			<FirstPage>339</FirstPage>
			<LastPage>351</LastPage>
			<ELocationID EIdType="pii">14531</ELocationID>
			
<ELocationID EIdType="doi">10.22049/cco.2023.27872.1377</ELocationID>
			
			<Language>EN</Language>
<AuthorList>
<Author>
					<FirstName>Lutz</FirstName>
					<LastName>Volkmann</LastName>
<Affiliation>Lehrstuhl II für Mathematik, RWTH Aachen University, 52056 Aachen, Germany</Affiliation>

</Author>
</AuthorList>
				<PublicationType>Journal Article</PublicationType>
			<History>
				<PubDate PubStatus="received">
					<Year>2022</Year>
					<Month>06</Month>
					<Day>09</Day>
				</PubDate>
			</History>
		<Abstract>Let $k\ge 1$ be an integer, and let $D$ be a finite and simple digraph with vertex set $V(D)$. A signed total Italian $k$-dominating function (STIkDF) on a 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 k$ for each vertex $v\in V(D)$, where $N^-(v)$ consists of all vertices of $D$ from which arcs go into $v$, and (ii) each vertex $u$ with $f(u)=-1$ has an in-neighbor $v$ for which $f(v)=2$ or two in-neighbors $w$ and $z$ with $f(w)=f(z)=1$. The weight of an STIkDF $f$ is $\omega(f)=\sum_{v\in V(D)}f(v)$. The signed total Italian $k$-domination number $\gamma_{stI}^k(D)$ of $D$ is the minimum weight of an STIkDF on $D$. In this paper we initiate the study of the signed total Italian $k$-domination number of digraphs, and we  present different bounds on $\gamma_{stI}^k(D)$. In addition, we determine the signed total Italian $k$-domination number of some classes of digraphs.</Abstract>
		<ObjectList>
			<Object Type="keyword">
			<Param Name="value">digraph</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Signed total Italian $k$-dominating function</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Signed total Italian $k$-domination number</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Signed total Roman $k$-dominating function</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Signed total Roman $k$-domination number</Param>
			</Object>
		</ObjectList>
<ArchiveCopySource DocType="pdf">https://comb-opt.azaruniv.ac.ir/article_14531_f1baab7c0a57df721eb7509b4c56f46e.pdf</ArchiveCopySource>
</Article>
</ArticleSet>
