The minus k-domination numbers in graphs
From MaRDI portal
Publication:5269918
DOI10.22049/CCO.2016.13534zbMATH Open1365.05074OpenAlexW2528589113MaRDI QIDQ5269918FDOQ5269918
Authors: N. Dehgardi
Publication date: 28 June 2017
Full work available at URL: https://doaj.org/article/7de48aec39ab42949a4220881124425a
Recommendations
Cited In (16)
- Minus \(k\)-subdomination in graphs
- A proof of a conjecture of minus domination in graphs
- A note on graphs with large girth and small minus domination number
- Lower bounds on the minus domination and \(k\)-subdomination numbers.
- Restricted minus domination number of a graph
- On the signed strong Roman domination number of graphs
- The minimum number of vertices in uniform hypergraphs with given domination number
- Upper minus domination number in \(k\)-regular graphs
- Signed and minus dominating functions in graphs
- On minus domination in graphs
- Title not available (Why is that?)
- The minus total k-domination numbers in graphs
- Title not available (Why is that?)
- Minus total \(k\)-subdomination in graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
This page was built for publication: The minus \(k\)-domination numbers in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5269918)