A note on the k-domination number of a graph
From MaRDI portal
Publication:919005
DOI10.1155/S016117129000031XzbMath0706.05033OpenAlexW2053891773MaRDI QIDQ919005
Publication date: 1990
Published in: International Journal of Mathematics and Mathematical Sciences (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/46506
Related Items (39)
A note on the annihilation number and 2-domination number of a tree ⋮ On $f$-domination number of a graph ⋮ A polynomial-time approximation to a minimum dominating set in a graph ⋮ The p-domination number of complete multipartite graphs ⋮ The annihilation number does not bound the 2-domination number from the above ⋮ Relating the annihilation number and the 2-domination number of a tree ⋮ Trees with maximum \(p\)-reinforcement number ⋮ A note on bounds for the broadcast domination number of graphs ⋮ Data reductions and combinatorial bounds for improved approximation algorithms ⋮ \(k\)-domination and total \(k\)-domination numbers in catacondensed hexagonal systems ⋮ Bounds on the \(k\)-domination number of a graph ⋮ On \(k\)-domination and \(j\)-independence in graphs ⋮ Algorithmic aspects of the \(k\)-domination problem in graphs ⋮ The \(p\)-bondage number of trees ⋮ \(k\)-domination and \(k\)-independence in graphs: A survey ⋮ Independence andk-domination in graphs ⋮ Relating the annihilation number and the 2-domination number of block graphs ⋮ Bounds on the 2-domination number ⋮ Exponential domination in subcubic graphs ⋮ On the domination number of Hamiltonian graphs with minimum degree six ⋮ On the \(p\)-reinforcement and the complexity ⋮ Domination in graphs of minimum degree five ⋮ An upper bound for domination number of 5-regular graphs ⋮ Some bounds on the \(p\)-domination number in trees ⋮ The Slater and sub-\(k\)-domination number of a graph with applications to domination and \(k\)-domination ⋮ Bounds on the exponential domination number ⋮ Domination in bipartite graphs ⋮ A bound on the k-domination number of a graph ⋮ Bounds on weak Roman and 2-rainbow domination numbers ⋮ Varieties of Roman Domination ⋮ Multiple Domination ⋮ Bipartite graphs with close domination and \(k\)-domination numbers ⋮ ANOTHER LOOK AT k-DOMINATION IN GRAPHS ⋮ Independent \((k + 1)\)-domination in \(k\)-trees ⋮ On certain spanning subgraphs of embeddings with applications to domination ⋮ Upper bounds for \(f\)-domination number of graphs ⋮ Minimum 2-dominating sets in regular graphs ⋮ General bounds on rainbow domination numbers ⋮ On general frameworks and threshold functions for multiple domination
This page was built for publication: A note on the k-domination number of a graph
