Algorithms and hardness results for edge total domination problem in graphs

DOI10.1016/j.tcs.2023.114270OpenAlexW4387807253MaRDI QIDQ6199394

Vikash Tripathi, Michael A. Henning, Arti Pandey, Gopika Sharma

Publication date: 23 February 2024

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2023.114270

zbMATH Keywords

NP-completenessgraph algorithmschordal graphsedge total dominationAPX-completeness

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the algorithmic complexity of edge total domination
• A linear time recognition algorithm for proper interval graphs
• The complexity of total edge domination and some related results on trees
• Complexity and characterization aspects of edge-related domination for graphs
• Results on vertex-edge and independent vertex-edge domination
• Upper bounds on the signed edge domination number of a graph
• Approximation hardness of edge dominating set problems
• The connected vertex cover problem in \(k\)-regular graphs
• Two classes of edge domination in graphs
• The Design of Approximation Algorithms
• Minimum Edge Dominating Sets
• Edge Dominating Sets in Graphs
• Bounds on total edge domination number of a tree
• Total vertex-edge domination

This page was built for publication: Algorithms and hardness results for edge total domination problem in graphs