Lower bounds on the minus domination and k-subdomination numbers.
From MaRDI portal
Publication:1401262
DOI10.1016/S0304-3975(02)00434-6zbMATH Open1046.68078MaRDI QIDQ1401262FDOQ1401262
Authors: H. Qiao, Erfang Shan, Du Ding-Zhu, Liying Kang 
Publication date: 17 August 2003
Published in: Theoretical Computer Science (Search for Journal in Brave)
Recommendations
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Minus domination in graphs
- Inequalities relating domination parameters in cubic graphs
- Title not available (Why is that?)
- Upper bounds for the \(k\)-subdomination number of graphs
- The algorithmic complexity of minus domination in graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Strict majority functions on graphs
Cited In (15)
- An application of the Turán theorem to domination in graphs
- Total minus domination in \(k\)-partite graphs
- Remarks on the minus (signed) total domination in graphs
- The power of small coalitions under two-tier majority on regular graphs
- Upper minus domination in a claw-free cubic graph
- Lower bounds on several versions of signed domination number
- Signed and minus dominating functions in graphs
- Minus domination number in \(k\)-partite graphs.
- Dominating functions with integer values in graphs—a survey
- Upper minus total domination in small-degree regular graphs
- The minus \(k\)-domination numbers in graphs
- On the Minus Domination Number of Graphs
- The algorithmic complexity of the minus clique-transversal problem
- Title not available (Why is that?)
- On the mixed minus domination in graphs
This page was built for publication: Lower bounds on the minus domination and \(k\)-subdomination numbers.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1401262)
