Bounds on total edge domination number of a tree
From MaRDI portal
Publication:5012811
Recommendations
- A lower bound on the total vertex-edge domination number of a tree
- A note on the total domination number of a tree
- An improved upper bound of edge-vertex domination number of a tree
- On trees attaining an upper bound on the total domination number
- The complexity of total edge domination and some related results on trees
Cites work
- scientific article; zbMATH DE number 437479 (Why is no real title available?)
- scientific article; zbMATH DE number 3674114 (Why is no real title available?)
- A lower bound on the total outer-independent domination number of a tree
- A note on the total domination number of a tree
- Bounds on the vertex-edge domination number of a tree
- Lower bound on the domination number of a tree
- The complexity of total edge domination and some related results on trees
Cited in
(12)- Bounds on the locating-total domination number in trees
- Bounds on the number of edges in hypertrees
- On \(n\)-total edge domination number in graphs
- Edge-vertex domination on interval graphs
- Bounds on the differentiating-total domination number of a tree
- scientific article; zbMATH DE number 7107005 (Why is no real title available?)
- Total domination on tree operators
- Bounds of the sum of edge lengths in linear arrangements of trees
- Bounds on the vertex-edge domination number of a tree
- Algorithms and hardness results for edge total domination problem in graphs
- On trees attaining an upper bound on the total domination number
- The complexity of total edge domination and some related results on trees
This page was built for publication: Bounds on total edge domination number of a tree
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5012811)