Pages that link to "Item:Q5037921"
From MaRDI portal
The following pages link to A note on the k-tuple domination number of graphs (Q5037921):
Displaying 16 items.
- Onk-tuple domination of random graphs (Q735107) (← links)
- A note on the k-domination number of a graph (Q919005) (← links)
- The upper bound on \(k\)-tuple domination numbers of graphs (Q925036) (← links)
- Proof of a conjecture on \(k\)-tuple domination in graphs (Q958895) (← links)
- \(k\)-tuple domination in graphs (Q1014390) (← links)
- Revisiting \(k\)-tuple dominating sets with emphasis on small values of \(k\) (Q2147590) (← links)
- On upper bounds for multiple domination numbers of graphs (Q2444571) (← links)
- New bounds on the \(k\)-domination number and the \(k\)-tuple domination number (Q2463933) (← links)
- A generalised upper bound for the \(k\)-tuple domination number (Q2470457) (← links)
- (Q2981134) (← links)
- (Q3012457) (← links)
- Bounds on the k-tuple domatic number of a graph (Q3096549) (← links)
- 3-Tuple domination number in complete grid graphs (Q3433467) (← links)
- A note on the \(k\)-tuple total domination number of a graph (Q5964651) (← links)
- Independent coalition in graphs: existence and characterization (Q6617237) (← links)
- More on the complexity of defensive domination in graphs (Q6657275) (← links)