Double vertex-edge domination

DOI10.1142/S1793830917500458zbMath1373.05142OpenAlexW2663774503MaRDI QIDQ5370818

Mustapha Chellali, Yanamandram B. Venkatakrishnan, Balakrishna Krishnakumari

Publication date: 20 October 2017

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

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

zbMATH Keywords

treesvertex-edge dominating setdouble vertex-edge dominating set

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items

Total vertex-edge domination in graphs: Complexity and algorithms ⋮ Results on vertex-edge and independent vertex-edge domination ⋮ On the double total dominator chromatic number of graphs ⋮ Edge-vertex domination in trees ⋮ Total outer connected vertex-edge domination ⋮ Vertex-edge domination in cubic graphs ⋮ Unnamed Item ⋮ An \(O(|E(G)|^2)\) algorithm for recognizing Pfaffian graphs of a type of bipartite graphs ⋮ Vertex-edge domination in graphs ⋮ Vertex-edge domination in unit disk graphs ⋮ Polynomial time algorithm for \(k\)-vertex-edge dominating problem in interval graphs ⋮ Double vertex-edge domination in graphs: complexity and algorithms ⋮ Polynomial time algorithm for \(k\)-vertex-edge dominating problem in interval graphs

Cites Work

• Bounds on weak Roman and 2-rainbow domination numbers
• Bounds on the vertex-edge domination number of a tree
• Total Domination in Graphs
• Vertex-edge domination in graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item