Edge weighting functions on dominating sets
From MaRDI portal
Recommendations
- Edge weighting functions on semitotal dominating sets
- Upper bounds on the upper signed total domination number of graphs
- Upper signed k-domination number in graphs.
- Upper bounds for k-tuple (total) domination numbers of regular graphs
- Upper bounds on the signed total \((k, k)\)-domatic number of graphs
Cites work
- A semi-induced subgraph characterization of upper domination perfect graphs
- Fault-tolerant locating-dominating sets
- scientific article; zbMATH DE number 1095171 (Why is no real title available?)
- scientific article; zbMATH DE number 1095172 (Why is no real title available?)
- On the computational complexity of upper total domination
- On the upper total domination number of Cartesian products of graphs
- Upper domination and upper irredundance perfect graphs
- Upper total domination in claw‐free graphs
- Vertex criticality for upper domination and irredundance
Cited in
(8)- Total domination versus domination in cubic graphs
- Edge weighting functions on semitotal dominating sets
- Upper total domination in claw-free cubic graphs
- 2-limited broadcast domination in subcubic graphs
- Algorithmic aspects of upper paired-domination in graphs
- Total dominating sequences in graphs
- The enclaveless competition game
- Domination parameters and added matchings
This page was built for publication: Edge weighting functions on dominating sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4916094)
