Bounds on the \(k\)-domination number of a graph
From MaRDI portal
Publication:2430065
DOI10.1016/j.aml.2011.01.013zbMath1216.05100MaRDI QIDQ2430065
Ryan Pepper, Michael A. Henning, Emil R. Vaughan, Ermelinda DeLaViña, Wayne Goddard
Publication date: 5 April 2011
Published in: Applied Mathematics Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.aml.2011.01.013
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)
Related Items
ANOTHER LOOK AT k-DOMINATION IN GRAPHS, Trees with 2-reinforcement number three, Relating the annihilation number and the 2-domination number of a tree, On the \(k\)-residue of disjoint unions of graphs with applications to \(k\)-independence, Trees with maximum \(p\)-reinforcement number, Exponential domination in subcubic graphs, \(k\)-domination and \(k\)-independence in graphs: A survey, Bounds on the exponential domination number, Complexity analysis of \(P_3\)-convexity problems on bounded-degree and planar graphs, Domination parameters with number 2: interrelations and algorithmic consequences, Relating the annihilation number and the 2-domination number of block graphs, New algorithms for weighted \(k\)-domination and total \(k\)-domination problems in proper interval graphs, On \(k\)-domination and \(j\)-independence in graphs, The p-domination number of complete multipartite graphs
Cites Work
