On \(k\)-vertex-edge domination of graph

DOI10.1007/s40840-023-01642-8arXiv2310.07452WikidataQ129358228 ScholiaQ129358228MaRDI QIDQ6146665

Subhabrata Paul, Debojyoti Bhattacharya

Publication date: 31 January 2024

Published in: Bulletin of the Malaysian Mathematical Sciences Society. Second Series (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2310.07452

zbMATH Keywords

approximation algorithmNP-completenessAPX-completeness\(k\)-vertex-edge domination

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Approximation algorithms (68W25)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Hardness results and approximation algorithms of \(k\)-tuple domination in graphs
• Double vertex-edge domination in graphs: complexity and algorithms
• Polynomial time algorithm for \(k\)-vertex-edge dominating problem in interval graphs
• Results on vertex-edge and independent vertex-edge domination
• Bounds on the vertex-edge domination number of a tree
• Vertex-edge domination in graphs
• Vertex-edge domination in unit disk graphs
• Vertex-edge domination in graphs

This page was built for publication: On \(k\)-vertex-edge domination of graph