Lower bounds on the signed (total) k-domination number
From MaRDI portal
Publication:4583543
DOI10.22049/CCO.2018.26055.1071zbMATH Open1394.05095OpenAlexW2888180870MaRDI QIDQ4583543FDOQ4583543
Authors: Lutz Volkmann 
Publication date: 31 August 2018
Full work available at URL: http://comb-opt.azaruniv.ac.ir/article_13779_039e0161b2a16abce42b7a252a65cb4e.pdf
Recommendations
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Signed total domination in graphs.
- New bounds on the signed total domination number of graphs
- Signed Total Domination Nnumber of a Graph
- Remarks on the minus (signed) total domination in graphs
- The signed \(k\)-domination numbers in graphs.
- Lower bounds on the signed total \(k\)-domination number of graphs
- Title not available (Why is that?)
- Lower bounds on several versions of signed domination number
- The signed \(k\)-domination number of directed graphs
- Title not available (Why is that?)
- Inequalities relating domination parameters in cubic graphs
- Lower bounds on the signed \(k\)-domination number of graphs.
- On the signed (total) \(k\)-domination number of a graph
- New and improved results on the signed (total) \(k\)-domination number of graphs
Cited In (7)
- Kernelization and Lower Bounds of the Signed Domination Problem
- An application of the Turán theorem to domination in graphs
- Lower bounds on the signed \(k\)-domination number of graphs.
- Lower bounds on the signed total \(k\)-domination number of graphs
- Lower bounds on several versions of signed domination number
- The signed and minus \(k\)-subdomination numbers of comets
- Title not available (Why is that?)
This page was built for publication: Lower bounds on the signed (total) \(k\)-domination number
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4583543)
