The minus total k-domination numbers in graphs
From MaRDI portal
Publication:5101875
DOI10.1142/S1793830921501500zbMath1493.05226OpenAlexW3175188597MaRDI QIDQ5101875
J. A. Dayap, Nasrin Dehgardi, Seyyed Mahmoud Sheikholeslami, Leila Asgharsharghi
Publication date: 2 September 2022
Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s1793830921501500
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Remarks on the minus (signed) total domination in graphs
- Minus domination in graphs
- Minus domination number in \(k\)-partite graphs.
- Signed total domination in graphs.
- Minus domination in regular graphs
- The algorithmic complexity of minus domination in graphs
- Twin minus total domination numbers in directed graphs
- Total minus domination in \(k\)-partite graphs
- Minus total domination in graphs
- On the Minus Domination Number of Graphs
- The minus $k$-domination numbers in graphs
- Twin minus domination in directed graphs
This page was built for publication: The minus total k-domination numbers in graphs