Pages that link to "Item:Q4598363"
From MaRDI portal
The following pages link to Lower Bounds on the Distance Domination Number of a Graph (Q4598363):
Displaying 4 items.
- Distance \(r\)-domination number and \(r\)-independence complexes of graphs (Q2122691) (← links)
- A linear-time algorithm for minimum \(k\)-hop dominating set of a cactus graph (Q2166266) (← links)
- The minimum number of vertices in uniform hypergraphs with given domination number (Q2401806) (← links)
- Distance Domination in Graphs (Q3384610) (← links)