The following pages link to Perfect codes over graphs (Q1057833):
Displaying 46 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)
- Subgroup perfect codes in Cayley sum graphs (Q780380) (← 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)
- Cyclotomic graphs and perfect codes (Q1621577) (← links)
- Perfect codes in power graphs of finite groups (Q1687066) (← links)
- On efficiently total dominatable digraphs (Q1714019) (← links)
- Efficient absorbants in generalized de Bruijn digraphs (Q1751232) (← links)
- Worst-case efficient dominating sets in digraphs (Q1949100) (← links)
- On codes in the projective linear group \(\mathrm{PGL}(2,q)\) (Q1979940) (← links)
- Distribution of global defensive \(k\)-alliances over some graph products (Q1999502) (← links)
- Perfect codes in Cayley sum graphs (Q2073316) (← links)
- Distance-regular graphs admitting a perfect 1-code (Q2113339) (← links)
- Classification of efficient dominating sets of circulant graphs of degree 5 (Q2157841) (← links)
- Subgroup regular sets in Cayley graphs (Q2166283) (← links)
- On subgroup perfect codes in Cayley graphs (Q2225434) (← links)
- Characterization of subgroup perfect codes in Cayley graphs (Q2305927) (← links)
- Perfect codes in direct graph bundles (Q2346568) (← links)
- Perfect codes in vertex-transitive graphs (Q2689009) (← links)
- Regular sets in Cayley graphs (Q2701120) (← links)
- Perfect Codes in Cayley Graphs (Q4604646) (← links)
- 1-perfect codes in Sierpiński graphs (Q4806494) (← links)
- Perfect codes in some products of graphs (Q4958057) (← links)
- On efficient absorbant conjecture in generalized De Bruijn digraphs (Q4976295) (← links)
- The fullerene graphs with a perfect star packing (Q5056834) (← links)
- (Q5104007) (← links)
- Subgroup Perfect Codes in Cayley Graphs (Q5128515) (← links)
- Perfect codes in proper reduced power graphs of finite groups (Q5131756) (← links)
- Perfect codes and universal adjacency spectra of commuting graphs of finite groups (Q5882598) (← links)
- Smallest independent dominating sets in Kronecker products of cycles (Q5951974) (← links)
- The (non-)existence of perfect codes in Fibonacci cubes (Q5964828) (← links)
- A general construction of strictly Neumaier graphs and a related switching (Q6046159) (← links)
- Characterizing subgroup perfect codes by 2-subgroups (Q6048702) (← links)
- Parameterized complexity of minimum membership dominating set (Q6090540) (← links)
