On vertex-edge and independent vertex-edge domination

DOI10.1007/978-3-030-36412-0_35zbMath1441.05174arXiv1910.03635OpenAlexW2992421611MaRDI QIDQ2180173

Keshav Ranjan, Subhabrata Paul

Publication date: 13 May 2020

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

zbMATH Keywords

NP-completenessvertex-edge dominationindependent vertex-edge domination

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (4)

Total vertex-edge domination in graphs: Complexity and algorithms ⋮ Vertex-edge domination in cubic graphs ⋮ Unnamed Item ⋮ Double vertex-edge domination in graphs: complexity and algorithms

This page was built for publication: On vertex-edge and independent vertex-edge domination