On weighted efficient total domination

DOI10.1016/J.JDA.2011.06.001zbMATH Open1237.68092OpenAlexW1980364610MaRDI QIDQ414423FDOQ414423

Authors: 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

Recommendations

• Weighted efficient domination problem on some perfect graphs
• The weighted perfect domination problem and its variants
• The weighted perfect domination problem
• A dichotomy for weighted efficient dominating sets with bounded degree vertices
• Exact and heuristic algorithms for the weighted total domination problem
• Efficient total domination in digraphs
• Weighted domination on cocomparability graphs
• Upper and lower bounds on approximating weighted mixed domination
• Upper and lower bounds on approximating weighted mixed domination
• New polynomial cases of the weighted efficient domination problem

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)

Cites Work

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

Cited In (6)

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

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

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