scientific article; zbMATH DE number 7481760
From MaRDI portal
Publication:5037236
Recommendations
- Bounds on the double edge-vertex domination number of a tree.
- Edge-vertex domination in trees
- Double vertex-edge domination
- scientific article; zbMATH DE number 1843906
- Double vertex-edge domination in graphs: complexity and algorithms
- Total vertex-edge domination in trees
- Domination and edge domination in trees
- scientific article; zbMATH DE number 1792607
- Double domination and super domination in trees
- On Double Domination in Graphs
Cites work
- A linear algorithm for finding a minimum dominating set in a cactus
- A linear algorithm for the domination number of a tree
- Bounds on the vertex-edge domination number of a tree
- Double vertex-edge domination
- On the algorithmic complexity of edge total domination
- Vertex-edge domination
- Vertex-edge domination in graphs
Cited in
(9)- Double vertex-edge domination in graphs: complexity and algorithms
- Results on vertex-edge and independent vertex-edge domination
- Domination edge lift critical trees
- Vertex-edge domination
- Bounds on the double edge-vertex domination number of a tree.
- scientific article; zbMATH DE number 1843906 (Why is no real title available?)
- On the algorithmic complexity of double vertex-edge domination in graphs
- Double vertex-edge domination
- On \(k\)-vertex-edge domination of graph
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5037236)