scientific article; zbMATH DE number 825134

MaRDI QIDQ4858149zbMATH OpenFDO

Authors Johannes H. Hattingh, Michael A. Henning, Peter Slater

Publication date 6 February 1996

zbMATH Keywords

dominating function

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• scientific article; zbMATH DE number 861417
• Algorithms and complexity of signed, minus, and majority domination
• Signed domination numbers of a graph and its complement
• scientific article; zbMATH DE number 2095760
• Minimal signed dominating functions of graphs

Cited in

(28)

• The signed domatic number of some regular graphs
• Some remarks on the signed domatic number of graphs with small minimum degree
• Efficient minus and signed domination in graphs
• Signed total domination in graphs.
• On complexities of minus domination
• The algorithmic complexity of minus domination in graphs
• The complexity of signed graph and edge-coloured graph homomorphisms
• An algorithmic characterization of splitting signed graph
• Minimum monopoly in regular and tree graphs
• Signed domatic number of a graph
• On complexities of minus domination
• FPT results for signed domination
• Algorithms and Hardness for Signed Domination
• Algorithms and complexity of signed, minus, and majority domination
• Signed and minus dominating functions in graphs
• Upper bounds on the signed (k, k)-domatic number
• Complexity of majority monopoly and signed domination problems
• The complexity of open \(k\)-monopolies in graphs for negative \(k\)
• scientific article; zbMATH DE number 7276884 (Why is no real title available?)
• scientific article; zbMATH DE number 6269006 (Why is no real title available?)
• Kernelization and Lower Bounds of the Signed Domination Problem
• Dominating functions with integer values in graphs—a survey
• Bounds on the signed domatic number
• Outer-independent signed Roman domination function in graphs
• On the complexity of signed domination
• Variations of \(Y\)-dominating functions on graphs
• An application of the Turán theorem to domination in graphs
• Discrepancy and signed domination in graphs and hypergraphs

This page was built for publication:

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