Mixed domination in undirected path graphs and block graphs

MaRDI QIDQ3131029zbMATH OpenFDO

Authors Erfang Shan, Haichao Wang, Yancai Zhao

Publication date 29 January 2018

zbMATH Keywords

NP-completenessblock graphundirected path graphmixed domination

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Recommendations

• The algorithmic complexity of mixed domination in graphs
• On the mixed domination problem in graphs
• An efficient algorithm for mixed domination on generalized series-parallel graphs
• The edge domination problem
• On the complexity of variations of mixed domination on graphs

Cited in

(7)

• On the complexity of variations of mixed domination on graphs
• On simultaneous domination and mixed connectivity in graphs
• The algorithmic complexity of mixed domination in graphs
• An efficient algorithm for mixed domination on generalized series-parallel graphs
• On the mixed domination problem in graphs
• Explicit construction of mixed dominating sets in generalized Petersen graphs
• Total mixed domination in graphs

This page was built for publication: Mixed domination in undirected path graphs and block graphs

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