Pages that link to "Item:Q2581114"
From MaRDI portal
The following pages link to A lower bound for the distance \(k\)-domination number of trees (Q2581114):
Displaying 5 items.
- A note on neighborhood total domination in graphs (Q746350) (← links)
- A linear-time algorithm for minimum \(k\)-hop dominating set of a cactus graph (Q2166266) (← links)
- Domination on hyperbolic graphs (Q2198410) (← links)
- Distance domination in graphs with given minimum and maximum degree (Q2410104) (← links)
- Distance Domination in Graphs (Q3384610) (← links)
