Bounds on the \(k\)-domination number of a graph

DOI10.1016/j.aml.2011.01.013zbMath1216.05100OpenAlexW1589406273MaRDI 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

zbMATH Keywords

graphindependence numbermatching number\(k\)-domination

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (14)

The p-domination number of complete multipartite graphs ⋮ Domination parameters with number 2: interrelations and algorithmic consequences ⋮ 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 ⋮ Complexity analysis of \(P_3\)-convexity problems on bounded-degree and planar graphs ⋮ On \(k\)-domination and \(j\)-independence in graphs ⋮ \(k\)-domination and \(k\)-independence in graphs: A survey ⋮ Relating the annihilation number and the 2-domination number of block graphs ⋮ Exponential domination in subcubic graphs ⋮ Bounds on the exponential domination number ⋮ ANOTHER LOOK AT k-DOMINATION IN GRAPHS ⋮ New algorithms for weighted \(k\)-domination and total \(k\)-domination problems in proper interval graphs ⋮ Trees with 2-reinforcement number three

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on the k-domination number of a graph
• New bounds on the \(k\)-domination number and the \(k\)-tuple domination number
• Onk-domination and minimum degree in graphs

This page was built for publication: Bounds on the \(k\)-domination number of a graph