Algorithmic aspects of total vertex-edge domination in graphs
DOI10.1142/S0129054123500247MaRDI QIDQ6629669FDOQ6629669
Authors: Hari Naresh Kumar, Mustapha Chellali, Yanamandram B. Venkatakrishnan 
Publication date: 30 October 2024
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
treesNP-completenesschordal graphstotal dominating setAPX-completenessvertex-edge dominating settotal vertex-edge dominating set
Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Cites Work
- Optimization, approximation, and complexity classes
- Total domination in graphs
- Bounds on the vertex-edge domination number of a tree
- Vertex-edge domination
- Algorithmic aspects of \(k\)-tuple total domination in graphs
- Algorithmic aspects of semitotal domination in graphs
- Vertex-edge domination in graphs
- A lower bound on the total vertex-edge domination number of a tree
- Total vertex-edge domination
This page was built for publication: Algorithmic aspects of total vertex-edge domination in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6629669)
