A new domination conception
From MaRDI portal
Publication:4201388
DOI10.1002/jgt.3190170306zbMath0777.05074MaRDI 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
05C35: Extremal problems in graph theory
Related Items
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, \(k\)-domination and \(k\)-independence in graphs: A survey, Bounds on weak Roman and 2-rainbow domination numbers, A polyhedral view to a generalization of multiple domination, Upper bounds for \(f\)-domination number of graphs, On \(f\)-domination: polyhedral and algorithmic results, On general frameworks and threshold functions for multiple domination, Algorithmic aspects of the \(k\)-domination problem in graphs, Restricted domination parameters in graphs, Some bounds on the \(p\)-domination number in trees, A bound on the k-domination number of a graph, Multiple Domination