Upper signed k-domination in a general graph
From MaRDI portal
Publication:765509
DOI10.1016/J.IPL.2010.05.019zbMATH Open1233.05145OpenAlexW2045037050MaRDI QIDQ765509FDOQ765509
Authors: Dejan Delić, Changping Wang 
Publication date: 19 March 2012
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2010.05.019
Recommendations
combinatorial problemssigned \(k\)-dominating functionminimal signed \(k\)-dominating functionupper signed \(k\)-domination number
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Signed total domination in graphs.
- Signed Total Domination Nnumber of a Graph
- The signed \(k\)-domination numbers in graphs.
- Two classes of edge domination in graphs
- Title not available (Why is that?)
- Signed domination in regular graphs
- On constructing \(k\)-connected \(k\)-dominating set in wireless ad hoc and sensor networks
- Title not available (Why is that?)
- Lower Bounds and Algorithms for Dominating Sets in Web Graphs
- A note on the lower bounds of signed domination number of a graph
- On edge domination numbers of graphs
- Title not available (Why is that?)
- Some more remarks on domination in cubic graphs
- The signed star domination numbers of the Cartesian product graphs
- Sparse hypercube 3-spanners
- On signed edge domination numbers of graphs
- Upper signed domination number
Cited In (3)
This page was built for publication: Upper signed \(k\)-domination in a general graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q765509)
