Pages that link to "Item:Q2410104"
From MaRDI portal
The following pages link to Distance domination in graphs with given minimum and maximum degree (Q2410104):
Displaying 5 items.
- A linear-time algorithm for minimum \(k\)-hop dominating set of a cactus graph (Q2166266) (← links)
- Improved upper bounds for identifying codes in \(n\)-dimensional \(q\)-ary cubes (Q2186954) (← links)
- Which graphs occur as \(\gamma\)-graphs? (Q2191276) (← links)
- The minimum number of vertices in uniform hypergraphs with given domination number (Q2401806) (← links)
- Distance Domination in Graphs (Q3384610) (← links)
