The upper bound on \(k\)-tuple domination numbers of graphs

DOI10.1016/j.ejc.2007.05.009zbMath1145.05039OpenAlexW2026596755MaRDI QIDQ925036

Gerard Jennhwa Chang

Publication date: 29 May 2008

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejc.2007.05.009

zbMATH Keywords

upper bound\(k\)-tuple domination number

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (11)

3-factor-criticality in double domination edge critical graphs ⋮ On the \(k\)-tuple domination of generalized de Brujin and Kautz digraphs ⋮ \(k\)-rainbow domatic numbers ⋮ On upper bounds for multiple domination numbers of graphs ⋮ Rainbow domination and related problems on strongly chordal graphs ⋮ Upper bounds on the balanced \(\langle \mathbf{r}, \mathbf{s} \rangle\)-domination number of a graph ⋮ MATCHING PROPERTIES IN DOUBLE DOMINATION EDGE CRITICAL GRAPHS ⋮ A note on the \(k\)-tuple total domination number of a graph ⋮ Onk-tuple domination of random graphs ⋮ Multiple Domination ⋮ Upper bounds for the domination numbers of graphs using Turán's theorem and Lovász local lemma

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• \(k\)-tuple domination in graphs
• Hardness results and approximation algorithms of \(k\)-tuple domination in graphs
• Algorithmic aspect of \(k\)-tuple domination in graphs.
• Nordhaus-Gaddum inequalities for domination in graphs
• New bounds on the \(k\)-domination number and the \(k\)-tuple domination number
• A generalised upper bound for the \(k\)-tuple domination number
• On Double Domination in Graphs

This page was built for publication: The upper bound on \(k\)-tuple domination numbers of graphs