Total vertex-edge domination
From MaRDI portal
Publication:5028563
DOI10.1080/00207160.2017.1343469zbMATH Open1499.05447OpenAlexW2624999672MaRDI QIDQ5028563FDOQ5028563
Authors: Razika Boutrig, Mustapha Chellali 
Publication date: 10 February 2022
Published in: International Journal of Computer Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207160.2017.1343469
Recommendations
Trees (05C05) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Cites Work
Cited In (22)
- A lower bound on the total vertex-edge domination number of a tree
- Vertex-edge domination in graphs
- Polynomial time algorithm for \(k\)-vertex-edge dominating problem in interval graphs
- Polynomial time algorithm for \(k\)-vertex-edge dominating problem in interval graphs
- Results on vertex-edge and independent vertex-edge domination
- Total vertex-edge domination in trees
- Total domination and vertex-edge domination in tres
- On a variant of vertex edge domination
- Vertex-edge domination in graphs
- 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
- Total vertex-edge domination in graphs: Complexity and algorithms
- Vertex-edge domination in unit disk graphs
- Total edge-vertex domination
- Algorithmic study on liar's vertex-edge domination problem
- Vertex-edge domination in cubic graphs
- On total vertex covers and edge domination in graphs
- Graphs with unique minimum vertex-edge dominating sets
- Dominating vertex covers: the vertex-edge domination problem
- Double vertex-edge domination
- Vertex-edge Roman domination
This page was built for publication: Total vertex-edge domination
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5028563)
