A realization algorithm for double domination in graphs

MaRDI QIDQ3534267zbMATH OpenFDO

Authors Michael A. Henning, Jochen Harant

Publication date 3 November 2008

zbMATH Keywords

total dominationdouble dominationrealization algorithmtriple domination

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Recommendations

• On Double Domination in Graphs
• scientific article; zbMATH DE number 1792607
• Double total domination of graphs
• Minimum 2-tuple dominating set of permutation graphs
• Revisiting \(k\)-tuple dominating sets with emphasis on small values of \(k\)

Cited in

(11)

• Double vertex-edge domination in graphs: complexity and algorithms
• An algorithm to check the equality of total domination number and double of domination number in graphs
• \(k\)-domination and \(k\)-independence in graphs: A survey
• k-tuple total domination in graphs
• Algorithms for secondary domination
• Double domination and super domination in trees
• Multiple domination models for placement of electric vehicle charging stations in road networks
• Doubling Algorithms with Permuted Lagrangian Graph Bases
• On Double Domination in Graphs
• Paired versus double domination in \(K_{1,r}\)-free graphs
• Multiple domination

This page was built for publication: A realization algorithm for double domination in graphs

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