Pages that link to "Item:Q2463933"

The following pages link to New bounds on the \(k\)-domination number and the \(k\)-tuple domination number (Q2463933):

Displaying 36 items.

• On the complexity of reinforcement in graphs (Q339476) (← links)
• Upper bounds on the balanced \(\langle \mathbf{r}, \mathbf{s} \rangle\)-domination number of a graph (Q477351) (← links)
• NP-hardness of multiple bondage in graphs (Q491093) (← links)
• Exponential domination in subcubic graphs (Q504979) (← links)
• \(k\)-domination and \(k\)-independence in graphs: A survey (Q659765) (← links)
• Bounds on the exponential domination number (Q729783) (← links)
• Onk-tuple domination of random graphs (Q735107) (← links)
• A polyhedral view to a generalization of multiple domination (Q832985) (← links)
• Probabilistic analysis of upper bounds for 2-connected distance \(k\)-dominating sets in graphs (Q837173) (← links)
• The upper bound on \(k\)-tuple domination numbers of graphs (Q925036) (← links)
• The \(k\)-tuple domination number revisited (Q952712) (← links)
• Proof of a conjecture on \(k\)-tuple domination in graphs (Q958895) (← links)
• The \(k\)-tuple twin domination in de Bruijn and Kautz digraphs (Q998382) (← links)
• Upper bounds on the \(k\)-domination number and the \(k\)-Roman domination number (Q1028141) (← links)
• New results on lower bounds for the number of \((\leq k)\)-facets (Q1039428) (← links)
• Connected \(k\)-tuple twin domination in de Bruijn and Kautz digraphs (Q1045016) (← links)
• Tight upper bounds for the domination numbers of graphs with given order and minimum degree. II (Q1589861) (← links)
• On \(d\)-distance \(m\)-tuple \((\ell,r)\)-domination in graphs (Q2059873) (← links)
• Improved bounds on the \(k\)-tuple (Roman) domination number of a graph (Q2121485) (← links)
• The Slater and sub-\(k\)-domination number of a graph with applications to domination and \(k\)-domination (Q2282474) (← links)
• On general frameworks and threshold functions for multiple domination (Q2352076) (← links)
• Generalized threshold processes on graphs (Q2402258) (← links)
• Bounds on the \(k\)-domination number of a graph (Q2430065) (← links)
• On defensive alliances and strong global offensive alliances (Q2434727) (← links)
• On upper bounds for multiple domination numbers of graphs (Q2444571) (← links)
• A generalised upper bound for the \(k\)-tuple domination number (Q2470457) (← links)
• 3-factor-criticality in double domination edge critical graphs (Q2631096) (← links)
• Upper bounds on the \(k\)-tuple (Roman) domination number of a graph (Q2657089) (← links)
• The p-domination number of complete multipartite graphs (Q2931929) (← links)
• Multiple Domination (Q3384609) (← links)
• (Q3507265) (← links)
• Onk-domination and minimum degree in graphs (Q3539928) (← links)
• MATCHING PROPERTIES IN DOUBLE DOMINATION EDGE CRITICAL GRAPHS (Q3575371) (← links)
• A lower bound on the $k$-conversion number of graphs of maximum degree $k+1$ (Q5135732) (← links)
• Partial domination - the isolation number of a graph (Q5162046) (← links)
• (Q5377028) (← links)