Upper minus domination in a claw-free cubic graph
From MaRDI portal
Publication:860466
DOI10.1016/J.DISC.2005.09.050zbMATH Open1106.05072OpenAlexW2089848382MaRDI QIDQ860466FDOQ860466
Authors: Jinjiang Yuan, Weiping Shang 
Publication date: 9 January 2007
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2005.09.050
Cites Work
- Title not available (Why is that?)
- Signed domination in regular graphs
- Minus domination in graphs
- Lower bounds on the minus domination and \(k\)-subdomination numbers.
- Title not available (Why is that?)
- The algorithmic complexity of minus domination in graphs
- Upper minus domination in regular graphs
- Minus domination in regular graphs
- Minus domination number in \(k\)-partite graphs.
- Title not available (Why is that?)
- Minus domination number in cubic graph
Cited In (7)
- An application of the Turán theorem to domination in graphs
- On complexities of minus domination
- Upper paired-domination in claw-free graphs
- Signed and minus dominating functions in graphs
- Dominating functions with integer values in graphs—a survey
- Upper total domination in claw‐free graphs
- Domination versus edge domination on claw-free graphs
This page was built for publication: Upper minus domination in a claw-free cubic graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q860466)
