Recommendations
Cites work
- Bounds on the vertex-edge domination number of a tree
- Total \(k\)-rainbow domination numbers in graphs
- Total domination in graphs
- Total domination in graphs
- Total Roman reinforcement in graphs
- Total vertex-edge domination
- Triple Roman domination in graphs
- Vertex-edge domination
- Vertex-edge domination in graphs
Cited in
(22)- Total domination and least domination in a tree
- The complexity of total edge domination and some related results on trees
- Results on vertex-edge and independent vertex-edge domination
- Bounds on the vertex-edge domination number of a tree
- On trees with total domination number equal to edge-vertex domination number plus one
- Domination edge lift critical trees
- Total outer-connected domination in trees
- Total domination and vertex-edge domination in tres
- On total vertex covers and edge domination in graphs
- Edge domination and 2-independence in trees
- Total vertex-edge domination
- Vertex-edge Roman domination
- scientific article; zbMATH DE number 7481760 (Why is no real title available?)
- Total vertex-edge domination in graphs: Complexity and algorithms
- Double vertex-edge domination
- A lower bound on the total vertex-edge domination number of a tree
- On a variant of vertex edge domination
- scientific article; zbMATH DE number 7693181 (Why is no real title available?)
- Total outer connected vertex-edge domination
- Algorithms and hardness results for edge total domination problem in graphs
- Algorithmic aspects of total vertex-edge domination in graphs
- Algorithmic study on liar's vertex-edge domination problem
This page was built for publication: Total vertex-edge domination in trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5021092)