On weighted efficient total domination

DOI10.1016/j.jda.2011.06.001zbMath1237.68092OpenAlexW1980364610MaRDI QIDQ414423

Oliver Schaudt

Publication date: 11 May 2012

Published in: Journal of Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jda.2011.06.001

zbMATH Keywords

total dominationefficient total dominationweighted efficient total dominationweighted efficient total edge domination

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)

Related Items (5)

A Taxonomy of Perfect Domination ⋮ Efficient total domination in digraphs ⋮ On efficiently total dominatable digraphs ⋮ Existence of efficient total dominating sets of circulant graphs of degree 4 ⋮ The total bondage numbers and efficient total dominations of vertex-transitive graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Graphs whose neighborhoods have no special cycles
• Efficient edge domination problems in graphs
• A strengthening of Ben Rebea's lemma
• A theory of alternating paths and blossoms for proving correctness of the \(O(\sqrt{V}E)\) general graph maximum matching algorithm
• Weighted efficient domination problem on some perfect graphs
• Weighted independent perfect domination on cocomparability graphs
• A \(max \{m, n \}\) algorithm for determining the graph H from its line graph G
• Balanced matrices
• Planar 3DM is NP-complete
• Total domination in graphs
• Graph Classes: A Survey

This page was built for publication: On weighted efficient total domination