New bounds on the \(k\)-domination number and the \(k\)-tuple domination number
From MaRDI portal
Publication:2463933
DOI10.1016/j.aml.2006.03.006zbMath1137.05054OpenAlexW2074106479MaRDI QIDQ2463933
Lutz Volkmann, Dieter Rautenbach
Publication date: 6 December 2007
Published in: Applied Mathematics Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.aml.2006.03.006
Related Items
Improved bounds on the \(k\)-tuple (Roman) domination number of a graph, A polyhedral view to a generalization of multiple domination, Probabilistic analysis of upper bounds for 2-connected distance \(k\)-dominating sets in graphs, 3-factor-criticality in double domination edge critical graphs, On the complexity of reinforcement in graphs, Upper bounds on the \(k\)-tuple (Roman) domination number of a graph, The p-domination number of complete multipartite graphs, Generalized threshold processes on graphs, Bounds on the \(k\)-domination number of a graph, On defensive alliances and strong global offensive alliances, On upper bounds for multiple domination numbers of graphs, The upper bound on \(k\)-tuple 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, NP-hardness of multiple bondage in graphs, Exponential domination in subcubic graphs, A generalised upper bound for the \(k\)-tuple domination number, The \(k\)-tuple domination number revisited, Partial domination - the isolation number of a graph, Proof of a conjecture on \(k\)-tuple domination in graphs, MATCHING PROPERTIES IN DOUBLE DOMINATION EDGE CRITICAL GRAPHS, The Slater and sub-\(k\)-domination number of a graph with applications to domination and \(k\)-domination, Bounds on the exponential domination number, The \(k\)-tuple twin domination in de Bruijn and Kautz digraphs, Onk-tuple domination of random graphs, Multiple Domination, Unnamed Item, On \(d\)-distance \(m\)-tuple \((\ell,r)\)-domination in graphs, Upper bounds on the \(k\)-domination number and the \(k\)-Roman domination number, Connected \(k\)-tuple twin domination in de Bruijn and Kautz digraphs, On general frameworks and threshold functions for multiple domination
Cites Work
