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

DOI10.1016/j.ejc.2007.05.009zbMath1145.05039MaRDI 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

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

Related Items

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

Cites Work

• \(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
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item