The upper bound on k-tuple domination numbers of graphs

DOI10.1016/J.EJC.2007.05.009zbMATH Open1145.05039OpenAlexW2026596755MaRDI QIDQ925036FDOQ925036

Authors: 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

Recommendations

• Improved upper bounds for the \(k\)-tuple domination number
• New bounds on the \(k\)-domination number and the \(k\)-tuple domination number
• A note on the k-tuple domination number of graphs
• Upper bounds on the \(k\)-tuple domination number and \(k\)-tuple total domination number of a graph
• A note on the \(k\)-tuple total domination number of a graph

zbMATH Keywords

upper bound\(k\)-tuple domination number

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• The probabilistic method. With an appendix on the life and work of Paul Erdős.
• Title not available (Why is that?)
• Title not available (Why is that?)
• \(k\)-tuple domination in graphs
• Title not available (Why is that?)
• New bounds on the \(k\)-domination number and the \(k\)-tuple domination number
• Nordhaus-Gaddum inequalities for domination in graphs
• Algorithmic aspect of \(k\)-tuple domination in graphs.
• Hardness results and approximation algorithms of \(k\)-tuple domination in graphs
• A generalised upper bound for the \(k\)-tuple domination number
• On Double Domination in Graphs

Cited In (27)

• On upper bounds for total k-domination number via the probabilistic method
• On upper bounds for multiple domination numbers of graphs
• New bounds on the \(k\)-domination number and the \(k\)-tuple domination number
• An upper bound for thek-domination number of a graph
• Some new results on the \(k\)-tuple domination number of graphs
• A generalised upper bound for the \(k\)-tuple domination number
• On the \(k\)-tuple domination of generalized de Brujin and Kautz digraphs
• \(k\)-rainbow domatic numbers
• Upper bounds on the balanced \(\langle \mathbf{r}, \mathbf{s} \rangle\)-domination number of a graph
• Title not available (Why is that?)
• Upper bounds for \(k\)-tuple (total) domination numbers of regular graphs
• Upper bounds for the \(k\)-subdomination number of graphs
• A note on the k-tuple domination number of graphs
• MATCHING PROPERTIES IN DOUBLE DOMINATION EDGE CRITICAL GRAPHS
• Upper bounds on the \(k\)-tuple domination number and \(k\)-tuple total domination number of a graph
• Proof of a conjecture on \(k\)-tuple domination in graphs
• The \(k\)-tuple domination number revisited
• A note on the \(k\)-tuple total domination number of a graph
• More on the complexity of defensive domination in graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Improved upper bounds for the \(k\)-tuple domination number
• Onk-tuple domination of random graphs
• Rainbow domination and related problems on strongly chordal graphs
• Upper bounds for the domination numbers of graphs using Turán's theorem and Lovász local lemma
• Multiple domination
• 3-factor-criticality in double domination edge critical graphs

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

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