The following pages link to (Q5284096):
Displaying 19 items.
- \((1, j)\)-set problem in graphs (Q294556) (← links)
- Efficient domination through eigenvalues (Q317399) (← links)
- Total perfect codes in Cayley graphs (Q329192) (← links)
- Efficient dominating sets in circulant graphs with domination number prime (Q402369) (← links)
- Polynomial-time algorithms for weighted efficient domination problems in AT-free graphs and dually chordal graphs (Q477653) (← links)
- Independent [1,2]-domination of grids via min-plus algebra (Q510530) (← links)
- Efficient dominating sets in circulant graphs (Q526230) (← links)
- On the domination number and the 2-packing number of Fibonacci cubes and Lucas cubes (Q639084) (← links)
- Algorithms for unipolar and generalized split graphs (Q741738) (← links)
- Efficient domination in circulant graphs with two chord lengths (Q846022) (← links)
- An almost complete description of perfect codes in direct products of cycles (Q864867) (← links)
- Perfect codes in direct products of cycles-a complete characterization (Q931836) (← links)
- A tight bound on the number of mobile servers to guarantee transferability among dominating configurations (Q972325) (← links)
- Quotients of Gaussian graphs and their application to perfect codes (Q975827) (← links)
- Characterizing \(r\)-perfect codes in direct products of two and three cycles (Q1041710) (← links)
- On perfect Lee codes (Q1045037) (← links)
- A dichotomy for weighted efficient dominating sets with bounded degree vertices (Q1628682) (← links)
- Efficient location of resources in cylindrical networks (Q1646261) (← links)
- A resource assignment problem on graphs (Q6487990) (← links)
