Upper signed k-domination in a general graph
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1095171 (Why is no real title available?)
- scientific article; zbMATH DE number 1095172 (Why is no real title available?)
- scientific article; zbMATH DE number 1109397 (Why is no real title available?)
- scientific article; zbMATH DE number 1462928 (Why is no real title available?)
- scientific article; zbMATH DE number 861417 (Why is no real title available?)
- A note on the lower bounds of signed domination number of a graph
- Lower Bounds and Algorithms for Dominating Sets in Web Graphs
- On constructing \(k\)-connected \(k\)-dominating set in wireless ad hoc and sensor networks
- On edge domination numbers of graphs
- On signed edge domination numbers of graphs
- Signed Total Domination Nnumber of a Graph
- Signed domination in regular graphs
- Signed total domination in graphs.
- Some more remarks on domination in cubic graphs
- Sparse hypercube 3-spanners
- The signed \(k\)-domination numbers in graphs.
- The signed star domination numbers of the Cartesian product graphs
- Two classes of edge domination in graphs
- Upper signed domination number
Cited in
(4)
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)