Lower bounds on several versions of signed domination number
From MaRDI portal
Publication:952644
DOI10.1016/J.DISC.2006.09.050zbMath1168.05343OpenAlexW2084587705MaRDI QIDQ952644
Publication date: 12 November 2008
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2006.09.050
Related Items (10)
Lower bounds on the signed total \(k\)-domination number of graphs ⋮ The power of small coalitions under two-tier majority on regular graphs ⋮ Domination in commuting graph and its complement ⋮ Unnamed Item ⋮ Upper bounds on the signed edge domination number of a graph ⋮ Lower bounds on nonnegative signed domination parameters in graphs ⋮ Lower bounds on the signed (total) $k$-domination number ⋮ Dominating functions with integer values in graphs—a survey ⋮ Signed and Minus Dominating Functions in Graphs ⋮ On the signed 2-independence number of graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A note on the lower bounds of signed domination number of a graph
- Signed domination in regular graphs and set-systems
- Lower bounds on the minus domination and \(k\)-subdomination numbers.
- Signed total domination in graphs.
- On the signed domination in graphs
- \(k\)-subdomination in graphs
- Signed domination in regular graphs
- Majority domination in graphs
- Signed Total Domination Nnumber of a Graph
This page was built for publication: Lower bounds on several versions of signed domination number