Algorithmic aspects of total vertex-edge domination in graphs

DOI10.1142/s0129054123500247MaRDI QIDQ6629669

Hari Naresh Kumar, Mustapha Chellali, Y. B. Venkatakrishnan

Publication date: 30 October 2024

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

zbMATH Keywords

NP-completenesstreeschordal graphstotal dominating setvertex-edge dominating setAPX-completenesstotal vertex-edge dominating set

Mathematics Subject Classification ID

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

• Title not available (Why is that?)
• Algorithmic aspects of \(k\)-tuple total domination in graphs
• Optimization, approximation, and complexity classes
• Algorithmic aspects of semitotal domination in graphs
• Bounds on the vertex-edge domination number of a tree
• Total Domination in Graphs
• Total vertex-edge domination
• A lower bound on the total vertex-edge domination number of a tree
• Vertex-edge domination in graphs

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)