On simultaneous domination and mixed connectivity in graphs

zbMATH Open1483.05001MaRDI QIDQ5066965FDOQ5066965

Authors: Sebastian S. Johann 

Publication date: 31 March 2022

Recommendations

• The algorithmic complexity of mixed domination in graphs
• Mixed domination in undirected path graphs and block graphs
• An efficient algorithm for mixed domination on generalized series-parallel graphs
• On the mixed domination problem in graphs
• Simultaneous domination in graphs

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Connectivity (05C40)

Cited In (3)

• On the mixed connectivity conjecture of Beineke and Harary
• Total mixed domination in graphs
• Simultaneously dominating all spanning trees of a graph

This page was built for publication: On simultaneous domination and mixed connectivity in graphs

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