The following pages link to Perfect codes over graphs (Q1057833):
Displayed 21 items.
- Total perfect codes in Cayley graphs (Q329192) (← links)
- Efficient dominating sets in circulant graphs with domination number prime (Q402369) (← links)
- Efficient twin domination in generalized de Bruijn digraphs (Q482195) (← links)
- A survey and classification of Sierpiński-type graphs (Q516890) (← links)
- Graphs that are simultaneously efficient open domination and efficient closed domination graphs (Q516892) (← links)
- Efficient dominating sets in circulant graphs (Q526230) (← links)
- Perfect codes in circulant graphs (Q526235) (← links)
- On perfect codes in Cartesian products of graphs (Q627927) (← links)
- Optimal tristance anticodes in certain graphs (Q817597) (← 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)
- Perfect \(r\)-domination in the Kronecker product of two cycles, with an application to diagonal/toroidal mesh (Q1014414) (← links)
- Polynomial algorithms for the weighted perfect domination problems on chordal graphs and split graphs (Q1313745) (← links)
- Weighted domination of cocomparability graphs (Q1382270) (← links)
- Efficient dominating sets in Cayley graphs. (Q1406027) (← links)
- Worst-case efficient dominating sets in digraphs (Q1949100) (← links)
- Perfect codes in direct graph bundles (Q2346568) (← links)
- 1-perfect codes in Sierpiński graphs (Q4806494) (← links)
- On efficient absorbant conjecture in generalized De Bruijn digraphs (Q4976295) (← links)
- Smallest independent dominating sets in Kronecker products of cycles (Q5951974) (← links)
- The (non-)existence of perfect codes in Fibonacci cubes (Q5964828) (← links)