Pages that link to "Item:Q919005"

The following pages link to A note on the k-domination number of a graph (Q919005):

Displaying 47 items.

• Relating the annihilation number and the 2-domination number of a tree (Q394342) (← links)
• Trees with maximum \(p\)-reinforcement number (Q401133) (← links)
• Exponential domination in subcubic graphs (Q504979) (← links)
• The \(p\)-bondage number of trees (Q659674) (← links)
• \(k\)-domination and \(k\)-independence in graphs: A survey (Q659765) (← links)
• Bounds on the exponential domination number (Q729783) (← links)
• Bounds on weak Roman and 2-rainbow domination numbers (Q741531) (← links)
• Independent \((k + 1)\)-domination in \(k\)-trees (Q777366) (← links)
• Data reductions and combinatorial bounds for improved approximation algorithms (Q899583) (← links)
• On the domination number of Hamiltonian graphs with minimum degree six (Q952720) (← links)
• Domination in bipartite graphs (Q998499) (← links)
• On certain spanning subgraphs of embeddings with applications to domination (Q1044949) (← links)
• Upper bounds for \(f\)-domination number of graphs (Q1584247) (← links)
• Relating the annihilation number and the 2-domination number of block graphs (Q1741511) (← links)
• Bounds on the 2-domination number (Q1744236) (← links)
• Bipartite graphs with close domination and \(k\)-domination numbers (Q2053423) (← links)
• Minimum 2-dominating sets in regular graphs (Q2091810) (← links)
• A polynomial-time approximation to a minimum dominating set in a graph (Q2166772) (← links)
• The annihilation number does not bound the 2-domination number from the above (Q2174567) (← links)
• On the \(p\)-reinforcement and the complexity (Q2253958) (← links)
• The Slater and sub-\(k\)-domination number of a graph with applications to domination and \(k\)-domination (Q2282474) (← links)
• General bounds on rainbow domination numbers (Q2345524) (← links)
• On general frameworks and threshold functions for multiple domination (Q2352076) (← links)
• A note on the annihilation number and 2-domination number of a tree (Q2359801) (← links)
• Bounds on the \(k\)-domination number of a graph (Q2430065) (← links)
• On \(k\)-domination and \(j\)-independence in graphs (Q2446328) (← links)
• Algorithmic aspects of the \(k\)-domination problem in graphs (Q2446334) (← links)
• New bounds on the \(k\)-domination number and the \(k\)-tuple domination number (Q2463933) (← links)
• Domination in graphs of minimum degree five (Q2494122) (← links)
• Some bounds on the \(p\)-domination number in trees (Q2501539) (← links)
• \(k\)-domination and total \(k\)-domination numbers in catacondensed hexagonal systems (Q2686849) (← links)
• A note on the domination number of a graph and its complement (Q2760899) (← links)
• On the \(k\)-domination number, the domination number and the cycle of length four (Q2811813) (← links)
• The p-domination number of complete multipartite graphs (Q2931929) (← links)
• Independence and<i>k</i>-domination in graphs (Q2995488) (← links)
• A bound on the k-domination number of a graph (Q3073450) (← links)
• Varieties of Roman Domination (Q3384116) (← links)
• Multiple Domination (Q3384609) (← links)
• Onk-domination and minimum degree in graphs (Q3539928) (← links)
• An upper bound for domination number of 5-regular graphs (Q3599930) (← links)
• (Q3620551) (← links)
• Note on the domination unmber of a graph (Q4274504) (← links)
• On $f$-domination number of a graph (Q4368817) (← links)
• On Dominating Sets and Independent Sets of Graphs (Q4946835) (← links)
• ANOTHER LOOK AT k-DOMINATION IN GRAPHS (Q4973417) (← links)
• A note on the \(k\)-tuple total domination number of a graph (Q5964651) (← links)
• A note on bounds for the broadcast domination number of graphs (Q6130225) (← links)