Lower bounds on several versions of signed domination number
From MaRDI portal
Publication:952644
DOI10.1016/J.DISC.2006.09.050zbMATH Open1168.05343OpenAlexW2084587705MaRDI QIDQ952644FDOQ952644
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
Recommendations
- Lower bounds on the signed (total) \(k\)-domination number
- LOWER BOUNDS OF SIGNED DOMINATION NUMBER OF A GRAPH
- scientific article; zbMATH DE number 5257358
- scientific article; zbMATH DE number 1932293
- A lower bound on the total signed domination numbers of graphs
- Lower bounds on the signed total \(k\)-domination number of graphs
- A note on the lower bounds of signed domination number of a graph
- Lower bounds on the signed \(k\)-domination number of graphs.
- Lower bounds on the signed domination numbers of directed graphs
- scientific article; zbMATH DE number 6908073
Cites Work
- Title not available (Why is that?)
- Signed total domination in graphs.
- Signed Total Domination Nnumber of a Graph
- Title not available (Why is that?)
- Signed domination in regular graphs
- Lower bounds on the minus domination and \(k\)-subdomination numbers.
- Title not available (Why is that?)
- Signed domination in regular graphs and set-systems
- On the signed domination in graphs
- Majority domination in graphs
- A note on the lower bounds of signed domination number of a graph
- Title not available (Why is that?)
- Partial signed domination in graphs
- \(k\)-subdomination in graphs
- Title not available (Why is that?)
Cited In (12)
- Kernelization and Lower Bounds of the Signed Domination Problem
- Lower bounds on the signed total \(k\)-domination number of graphs
- Title not available (Why is that?)
- The power of small coalitions under two-tier majority on regular graphs
- Dominating functions with integer values in graphs—a survey
- Upper bounds on the signed edge domination number of a graph
- Lower bounds on nonnegative signed domination parameters in graphs
- Signed and Minus Dominating Functions in Graphs
- Lower bounds on the signed (total) $k$-domination number
- Domination in commuting graph and its complement
- Title not available (Why is that?)
- On the signed 2-independence number of graphs
This page was built for publication: Lower bounds on several versions of signed domination number
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q952644)