Complexity of the paired domination subdivision problem

DOI10.22049/CCO.2021.27010.1180zbMATH Open1524.05206OpenAlexW3177599935MaRDI QIDQ6101488FDOQ6101488

Authors: J. Amjadi, Mustapha Chellali 

Publication date: 1 June 2023

Full work available at URL: http://comb-opt.azaruniv.ac.ir/article_14247_08ac472a3d6ffd5b00101026495496a4.pdf

Recommendations

• Paired domination subdivision and multisubdivision numbers of graphs
• Paired-domination subdivision numbers of graphs
• Minimum paired-dominating set in chordal bipartite graphs and perfect elimination bipartite graphs
• Domination subdivision and domination multisubdivision numbers of graphs
• Upper bounds on the paired domination subdivision number of a graph

zbMATH Keywords

paired domination numberpaired dominating setpaired domination subdivision number

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Cites Work

• Title not available (Why is that?)
• Paired-domination in graphs
• Upper bounds on the paired domination subdivision number of a graph
• Paired-domination subdivision numbers of graphs
• Paired domination in graphs
• A proof of a conjecture on the paired-domination subdivision number

Cited In (1)

• A proof of a conjecture on the paired-domination subdivision number

This page was built for publication: Complexity of the paired domination subdivision problem

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