Generalization of the total outer-connected domination in graphs
From MaRDI portal
Publication:2805478
Recommendations
Cites work
- scientific article; zbMATH DE number 1095171 (Why is no real title available?)
- A note on the total outer-connected domination number of a tree
- Inequality of Nordhaus-Gaddum type for total outer-connected domination in graphs
- Total outer-connected domination in trees
- Total outer-connected domination numbers of trees
Cited in
(11)- scientific article; zbMATH DE number 5823716 (Why is no real title available?)
- An extension of locating-total domination problem and its complexity
- Total outer-connected domination in trees
- The outer-connected domination number of Sierpiński-like graphs
- scientific article; zbMATH DE number 6707348 (Why is no real title available?)
- Outer-\(k\)-connected component domination in graphs
- On the total outer-connected domination in graphs
- Inequality of Nordhaus-Gaddum type for total outer-connected domination in graphs
- Unicyclic graphs with equal total and total outer-connected domination numbers.
- scientific article; zbMATH DE number 7690927 (Why is no real title available?)
- Dominating sets inducing large components
This page was built for publication: Generalization of the total outer-connected domination in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2805478)