On -domination in graphs
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?)
- Edge-removal and edge-addition in \(\alpha \)-domination
- Highly connected counterexamples to a conjecture on α -domination
- Irreversible \(k\)-threshold processes: Graph-theoretical threshold models of the spread of disease and of opinion
- Local majorities, coalitions and monopolies in graphs: A review
- On graphs with equal domination and covering numbers
- Some remarks on alpha-domination
- The probabilistic method. With an appendix on the life and work of Paul Erdős.
- Upper bounds for \(\alpha \)-domination parameters
- Vertex-removal in \(K\)-domination
- \(\alpha \)-domination perfect trees
- \(\alpha\)-domination
Cited in
(16)- scientific article; zbMATH DE number 1990685 (Why is no real title available?)
- Connected domination value in graphs
- Highly connected counterexamples to a conjecture on α -domination
- Some remarks on alpha-domination
- Applying the (1,2)-pitchfork domination and it's inverse on some special graphs
- Edge-removal and edge-addition in \(\alpha \)-domination
- Upper bounds for \(\alpha \)-domination parameters
- Doubly connected bi-domination in graphs
- Total pitchfork domination and its inverse in graphs
- \(\alpha \)-domination perfect trees
- Some modified types of pitchfork domination and it's inverse
- Partial domination in supercubic graphs
- \(\alpha\)-domination
- Total \(\alpha\)-domination in graphs
- On \(\alpha\)-split domination in graphs
- Pitchfork domination in graphs
This page was built for publication: On \(\alpha \)-domination in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1706432)
