Algorithmic aspects of total vertex-edge domination in graphs

DOI10.1142/S0129054123500247MaRDI QIDQ6629669zbMATH OpenFDO

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)

Full work available at URL https://doi.org/10.1142/S0129054123500247

zbMATH Keywords

APX-completenesschordal graphsNP-completenesstotal dominating settotal vertex-edge dominating settreesvertex-edge dominating set

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Total vertex-edge domination in graphs: Complexity and algorithms
• On the algorithmic complexity of double vertex-edge domination in graphs
• Algorithmic aspects of vertex-edge domination in some graphs.
• Total vertex-edge domination in trees
• Total vertex-edge domination

Cites work

• A lower bound on the total vertex-edge domination number of a tree
• Algorithmic aspects of \(k\)-tuple total domination in graphs
• Algorithmic aspects of semitotal domination in graphs
• Bounds on the vertex-edge domination number of a tree
• Optimization, approximation, and complexity classes
• Total domination in graphs
• Total vertex-edge domination
• Vertex-edge domination
• Vertex-edge domination in graphs

Cited in

(2)

• On \(k\)-vertex-edge domination of graph
• Algorithmic aspects of vertex-edge domination in some 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)