Pages that link to "Item:Q2501539"
From MaRDI portal
The following pages link to Some bounds on the \(p\)-domination number in trees (Q2501539):
Displaying 21 items.
- Trees with 2-reinforcement number three (Q263026) (← links)
- On the complexity of reinforcement in graphs (Q339476) (← links)
- Trees with maximum \(p\)-reinforcement number (Q401133) (← links)
- NP-hardness of multiple bondage in graphs (Q491093) (← links)
- A new generalization of kernels in digraphs (Q516902) (← links)
- The \(p\)-bondage number of trees (Q659674) (← links)
- \(k\)-domination and \(k\)-independence in graphs: A survey (Q659765) (← links)
- Independent \((k + 1)\)-domination in \(k\)-trees (Q777366) (← links)
- Bounds on the differentiating-total domination number of a tree (Q906441) (← links)
- A direct inductive proof of a conjecture due to E. Sampathkumar and L. Pushpa Latha on the weak domination number of a tree (Q1273282) (← links)
- Complexity of \(k\)-rainbow independent domination and some results on the lexicographic product of graphs (Q2008916) (← links)
- On the \(p\)-reinforcement and the complexity (Q2253958) (← links)
- On the complexity of multiple bondage in graphs (Q2333796) (← links)
- On trees attaining an upper bound on the total domination number (Q2411982) (← links)
- Bounds on the vertex-edge domination number of a tree (Q2450268) (← links)
- Trees with unique minimum \(p\)-dominating sets (Q2895378) (← links)
- The p-domination number of complete multipartite graphs (Q2931929) (← links)
- Independence and<i>k</i>-domination in graphs (Q2995488) (← links)
- Multiple Domination (Q3384609) (← links)
- A note on the p-domination number of trees (Q3640021) (← links)
- Counting Power Domination Sets in Complete m-ary Trees (Q5869879) (← links)
