Minus domination in graphs
From MaRDI portal
Publication:1297430
DOI10.1016/S0012-365X(98)00284-2zbMATH Open0928.05046OpenAlexW2020597434MaRDI QIDQ1297430FDOQ1297430
Stephen T. Hedetniemi, Jean E. Dunbar, Michael A. Henning, Alice A. McRae
Publication date: 9 January 2000
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0012-365x(98)00284-2
Recommendations
Trees (05C05) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Properties of Hereditary Hypergraphs and Middle Graphs
- The algorithmic complexity of minus domination in graphs
- Contributions to the theory of domination, independence and irredundance in graphs
- Domination, Fractional Domination, 2-Packing, and Graph Products
- Chordal graphs and upper irredundance, upper domination and independence
- Fractional domination of strong direct products
- Title not available (Why is that?)
- Title not available (Why is that?)
- Minus domination in regular graphs
Cited In (42)
- An application of the Turán theorem to domination in graphs
- A proof of a conjecture of minus domination in graphs
- The algorithmic complexity of minus domination in graphs
- Elimination properties for minimal dominating sets of graphs
- Title not available (Why is that?)
- Lower bounds on the minus domination and \(k\)-subdomination numbers.
- Minus domination in regular graphs
- Reverse minus edge total domination in graphs
- Total minus domination in \(k\)-partite graphs
- Generalized domination and efficient domination in graphs
- Inequalities relating domination parameters in cubic graphs
- Some remarks on domination in cubic graphs
- On complexities of minus domination
- Algorithms and Complexity of Signed, Minus, and Majority Domination
- Dual domination problems in graphs
- Upper minus domination in a claw-free cubic graph
- Signed total domination in graphs.
- Algorithmic Aspect of Minus Domination on Small-Degree Graphs
- On minus domination in graphs
- The signed and minus \(k\)-subdomination numbers of comets
- Minus domination number in \(k\)-partite graphs.
- Dominating functions with integer values in graphs—a survey
- Upper minus total domination in small-degree regular graphs
- On the Minus Domination Number of Graphs
- Majority domination in graphs
- On the balanced domination of graphs
- Real and integer domination in graphs
- The minus total k-domination numbers in graphs
- Minus \(k\)-subdomination in graphs. II
- Signed and Minus Dominating Functions in Graphs
- INVERSE MINUS DOMINATION IN GRAPHS
- Title not available (Why is that?)
- Alliances and Related Domination Parameters
- Opinion functions on trees
- Title not available (Why is that?)
- Characterization of signed paths and cycles admitting minus dominating function
- Minus domination in small-degree graphs
- Roman domination excellent graphs: trees
- Variations of \(Y\)-dominating functions on graphs
- Minus total domination in graphs
- A note on domination and minus domination numbers in cubic graphs
- On the mixed minus domination in graphs
This page was built for publication: Minus domination in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1297430)
