Pages that link to "Item:Q2430065"
From MaRDI portal
The following pages link to Bounds on the \(k\)-domination number of a graph (Q2430065):
Displaying 25 items.
- Trees with 2-reinforcement number three (Q263026) (← links)
- On the lower bound of \(k\)-maximal digraphs (Q294549) (← links)
- Relating the annihilation number and the 2-domination number of a tree (Q394342) (← links)
- On the \(k\)-residue of disjoint unions of graphs with applications to \(k\)-independence (Q394539) (← 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)
- Complexity analysis of \(P_3\)-convexity problems on bounded-degree and planar graphs (Q897965) (← links)
- Upper bounds for the \(k\)-subdomination number of graphs (Q1598803) (← links)
- Domination parameters with number 2: interrelations and algorithmic consequences (Q1682877) (← links)
- Bounds on the domination number of a digraph (Q1698058) (← links)
- Relating the annihilation number and the 2-domination number of block graphs (Q1741511) (← links)
- A bound for the \(p\)-domination number of a graph in terms of its eigenvalue multiplicities (Q2104984) (← links)
- New algorithms for weighted \(k\)-domination and total \(k\)-domination problems in proper interval graphs (Q2330102) (← links)
- On \(k\)-domination and \(j\)-independence in graphs (Q2446328) (← links)
- The p-domination number of complete multipartite graphs (Q2931929) (← links)
- A bound on the k-domination number of a graph (Q3073450) (← links)
- BOUNDS ON THE DOMINATION NUMBER OF A GRAPH (Q3353049) (← links)
- An upper bound for thek-domination number of a graph (Q3815347) (← links)
- Bounds on the sum of domination number and metric dimension of graphs (Q4554552) (← links)
- ANOTHER LOOK AT k-DOMINATION IN GRAPHS (Q4973417) (← links)
- (Q5061861) (← links)
- A lower bound on the $k$-conversion number of graphs of maximum degree $k+1$ (Q5135732) (← links)
- Bounds for the Grundy chromatic number of graphs in terms of domination number (Q6073792) (← links)