Pages that link to "Item:Q3539928"
From MaRDI portal
The following pages link to Onk-domination and minimum degree in graphs (Q3539928):
Displaying 34 items.
- Trees with 2-reinforcement number three (Q263026) (← links)
- The difference between the metric dimension and the determining number of a graph (Q298637) (← links)
- On vertex independence number of uniform hypergraphs (Q399512) (← links)
- Trees with maximum \(p\)-reinforcement number (Q401133) (← 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)
- Upper bounds for \(\alpha \)-domination parameters (Q844230) (← links)
- Restricted domination in graphs with minimum degree 2 (Q878627) (← links)
- On \(K_{s,t}\)-minors in graphs with given average degree (Q941384) (← links)
- Tight upper bounds for the domination numbers of graphs with given order and minimum degree. II (Q1589861) (← links)
- Domination parameters with number 2: interrelations and algorithmic consequences (Q1682877) (← links)
- Client-server and cost effective sets in graphs (Q1713579) (← 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)
- A simple optimal algorithm for \(k\)-tuple dominating problem in interval graphs (Q2102897) (← links)
- The Slater and sub-\(k\)-domination number of a graph with applications to domination and \(k\)-domination (Q2282474) (← links)
- New algorithms for weighted \(k\)-domination and total \(k\)-domination problems in proper interval graphs (Q2330102) (← links)
- Generalized threshold processes on graphs (Q2402258) (← 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)
- Dominating sets inducing large components (Q2629281) (← links)
- \(k\)-domination and total \(k\)-domination numbers in catacondensed hexagonal systems (Q2686849) (← links)
- On minimum degree of strongly \(k\)-extendable graphs (Q2747189) (← links)
- On the \(k\)-domination number, the domination number and the cycle of length four (Q2811813) (← links)
- Independence and<i>k</i>-domination in graphs (Q2995488) (← links)
- A bound on the k-domination number of a graph (Q3073450) (← links)
- Multiple Domination (Q3384609) (← links)
- On the product of \(k\)-minimal domination numbers of a graph and its complement (Q3980554) (← links)
- Game $k$-Domination Number of Graphs (Q5029314) (← links)
- Partial domination - the isolation number of a graph (Q5162046) (← links)