A new domination conception
From MaRDI portal
Publication:4201388
DOI10.1002/jgt.3190170306zbMath0777.05074OpenAlexW2131172084MaRDI QIDQ4201388
Christoph Stracke, Lutz Volkmann
Publication date: 24 August 1993
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.3190170306
Related Items (14)
A polyhedral view to a generalization of multiple domination ⋮ On $f$-domination number of a graph ⋮ Inequalities involving independence domination, f-domination, connected and total f-domination numbers ⋮ Relating the annihilation number and the 2-domination number of a tree ⋮ Algorithmic aspects of the \(k\)-domination problem in graphs ⋮ \(k\)-domination and \(k\)-independence in graphs: A survey ⋮ Restricted domination parameters in graphs ⋮ On \(f\)-domination: polyhedral and algorithmic results ⋮ Some bounds on the \(p\)-domination number in trees ⋮ A bound on the k-domination number of a graph ⋮ Bounds on weak Roman and 2-rainbow domination numbers ⋮ Multiple Domination ⋮ Upper bounds for \(f\)-domination number of graphs ⋮ On general frameworks and threshold functions for multiple domination
This page was built for publication: A new domination conception
