Remarks on the minus (signed) total domination in graphs
From MaRDI portal
Publication:932611
DOI10.1016/j.disc.2007.06.015zbMath1169.05367OpenAlexW2083981623MaRDI QIDQ932611
Erfang Shan, Cheng, T. C. Edwin
Publication date: 11 July 2008
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10397/472
Related Items (13)
New bounds on the signed total domination number of graphs ⋮ Lower bounds on the signed total \(k\)-domination number of graphs ⋮ COMPLEXITY OF CERTAIN FUNCTIONAL VARIANTS OF TOTAL DOMINATION IN CHORDAL BIPARTITE GRAPHS ⋮ Signed total Roman domination in graphs ⋮ Twin minus total domination numbers in directed graphs ⋮ The minus total k-domination numbers in graphs ⋮ Unnamed Item ⋮ Signed total Roman domination in digraphs ⋮ On complexities of minus domination ⋮ Lower bounds on the signed (total) $k$-domination number ⋮ On the complexity of signed and minus total domination in graphs ⋮ Dominating functions with integer values in graphs—a survey ⋮ Signed and Minus Dominating Functions in Graphs
Cites Work
- Lower bounds on the minus domination and \(k\)-subdomination numbers.
- Minus domination number in \(k\)-partite graphs.
- Signed total domination in graphs.
- A proof of a conjecture of minus domination in graphs
- Upper minus total domination in small-degree regular graphs
- Total minus domination in \(k\)-partite graphs
- Signed Total Domination Nnumber of a Graph
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Remarks on the minus (signed) total domination in graphs