Algorithmic aspects of vertex-edge domination in some graphs.

DOI10.61091/ARS158-03MaRDI QIDQ6550668FDOQ6550668

Authors: H. Naresh Kumar, Yanamandram B. Venkatakrishnan 

Publication date: 5 June 2024

Published in: Ars Combinatoria (Search for Journal in Brave)

Recommendations

• On the algorithmic complexity of double vertex-edge domination in graphs
• Double vertex-edge domination in graphs: complexity and algorithms
• Algorithmic aspects of total vertex-edge domination in graphs
• Results on vertex-edge and independent vertex-edge domination

zbMATH Keywords

NP-completenessproper interval graphchordal bipartite graphundirected path graphAPX-completenessvertex-edge dominating set

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Cited In (4)

• On \(k\)-vertex-edge domination of graph
• Edge-vertex domination of acyclic trapezoid graphs: algorithm and complexity
• Algorithmic aspects of total vertex-edge domination in graphs
• Edge-vertex domination on interval graphs

This page was built for publication: Algorithmic aspects of vertex-edge domination in some graphs.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6550668)