Complexity of the paired domination subdivision problem

DOI10.22049/CCO.2021.27010.1180MaRDI QIDQ6101488zbMATH OpenOpenAlexFDO

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

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)

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

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• A proof of a conjecture on the paired-domination subdivision number
• Paired domination in graphs
• Paired-domination in graphs
• Paired-domination subdivision numbers of graphs
• Upper bounds on the paired domination subdivision number of a graph

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)