On the Italian reinforcement number of a digraph

DOI10.3934/MATH.2021382MaRDI QIDQ2133372zbMATH OpenOpenAlexFDO

Authors Zhihong Xie, Guoliang Hao, Shuting Zeng, Seyed Mahmood Sheikholeslami

Publication date 29 April 2022

Published in AIMS Mathematics (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.3934/math.2021382

zbMATH Keywords

Cartesian productdirected graphItalian domination numberItalian reinforcement number

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Recommendations

• Reinforcement numbers of digraphs
• Roman reinforcement numbers of digraphs
• Italian domination in digraphs
• Rainbow reinforcement numbers in digraphs
• Italian domination of Cartesian products of directed cycles

Cites work

• A note on Roman \(\{2\}\)-domination in digraphs.
• Bounds on the outer-independent double Italian domination number
• scientific article; zbMATH DE number 1095171 (Why is no real title available?)
• scientific article; zbMATH DE number 1095172 (Why is no real title available?)
• Independent Roman \(\{2 \}\)-domination in graphs
• Italian domination in digraphs
• Italian domination in trees
• Number extensions and some equations in Clifford algebras
• Perfect Italian domination in trees
• Roman \(\{2 \}\)-domination
• Roman domination in graphs
• The Italian domatic number of a digraph
• Varieties of Roman Domination
• Varieties of Roman domination. II

Cited in

(1)

• Reinforcement numbers of digraphs

This page was built for publication: On the Italian reinforcement number of a digraph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2133372)