Double domination and super domination in trees
From MaRDI portal
(Redirected from Publication:5298352)
Recommendations
Cites work
- A realization algorithm for double domination in graphs
- Characterization of double domination subdivision number of trees
- Double domination in complementary prisms
- Double domination stable graphs upon edge removal
- 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 1792607 (Why is no real title available?)
- scientific article; zbMATH DE number 6107208 (Why is no real title available?)
- On trees with double domination number equal to 2-domination number plus one
- Super dominating sets in graphs
Cited in
(15)- Super domination in trees
- Superior domination in graphs
- On computing secure domination of trees
- scientific article; zbMATH DE number 7481760 (Why is no real title available?)
- Super domination in trees
- Relating the super domination and 2-domination numbers in cactus graphs
- Computational complexity aspects of super domination
- k-Efficient domination: Algorithmic perspective
- Super domination: graph classes, products and enumeration
- 2-Point set domination in separable graphs
- Total outer connected vertex-edge domination
- Some results on the super domination number of a graph
- Some results on the super domination number of a graph. II
- On double domination numbers of signed complete graphs
- Super dominating sets in graphs
This page was built for publication: Double domination and super domination in trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5298352)