The \(k\)-tuple domination number revisited
From MaRDI portal
Publication:952712
DOI10.1016/j.aml.2007.10.016zbMath1166.05010OpenAlexW2077251859MaRDI QIDQ952712
Publication date: 14 November 2008
Published in: Applied Mathematics Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.aml.2007.10.016
Related Items (10)
Probabilistic analysis of upper bounds for 2-connected distance \(k\)-dominating sets in graphs ⋮ Upper bounds for \(\alpha \)-domination parameters ⋮ A Note of Independent Number and Domination Number of Qn,k,m-Graph ⋮ On the \(k\)-tuple domination of generalized de Brujin and Kautz digraphs ⋮ On upper bounds for multiple domination numbers of graphs ⋮ \(k\)-domination and \(k\)-independence in graphs: A survey ⋮ Upper bounds on the balanced \(\langle \mathbf{r}, \mathbf{s} \rangle\)-domination number of a graph ⋮ MATCHING PROPERTIES IN DOUBLE DOMINATION EDGE CRITICAL GRAPHS ⋮ Multiple Domination ⋮ On general frameworks and threshold functions for multiple domination
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Hardness results and approximation algorithms of \(k\)-tuple domination in graphs
- On the ratio of optimal integral and fractional covers
- 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 \(k\)-tuple domination number revisited