Implications of some observations about the k-domination number

zbMATH Open1218.05117MaRDI QIDQ2995153FDOQ2995153

Authors: Ryan Pepper 

Publication date: 20 April 2011

Recommendations

• An upper bound for thek-domination number of a graph
• Onk-domination and minimum degree in graphs
• A bound on the \(k\)-domination number of a graph.
• New bounds on the \(k\)-domination number and the \(k\)-tuple domination number
• On the \(k\)-domination, \(k\)-tuple domination and Roman \(k\)-domination numbers in graphs

zbMATH Keywords

domination numberindependence number\(k\)-independence number\(k\)-domination number

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Cited In (10)

• Relating the annihilation number and the 2-domination number of a tree
• A note on the annihilation number and 2-domination number of a tree
• \(k\)-domination and \(k\)-independence in graphs: A survey
• Multiple Domination
• Upper bounds on the \(k\)-forcing number of a graph
• The Slater and sub-\(k\)-domination number of a graph with applications to domination and \(k\)-domination
• Bounds on the \(k\)-domination number of a graph
• On \(k\)-domination and \(j\)-independence in graphs
• On the \(k\)-residue of disjoint unions of graphs with applications to \(k\)-independence
• Conjecture of TxGraffiti: Independence, domination, and matchings

This page was built for publication: Implications of some observations about the \(k\)-domination number

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2995153)