The following pages link to Perfect codes in graphs (Q2559208):
Displaying 50 items.
- On the efficiency index of a graph (Q266040) (← links)
- Efficient domination through eigenvalues (Q317399) (← links)
- Kernelization of edge perfect code and its variants (Q317422) (← links)
- Quasiperfect domination in trees (Q324884) (← links)
- Total perfect codes in Cayley graphs (Q329192) (← links)
- Efficient dominating sets in circulant graphs with domination number prime (Q402369) (← links)
- Efficient domination in cubic vertex-transitive graphs (Q449200) (← links)
- Polynomial-time algorithms for weighted efficient domination problems in AT-free graphs and dually chordal graphs (Q477653) (← 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)
- Finding dominating induced matchings in \(P_8\)-free graphs in polynomial time (Q524382) (← 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)
- Weighted codes in Lee metrics (Q735023) (← links)
- Finding dominating induced matchings in \(S_{1, 1, 5}\)-free graphs in polynomial time (Q777392) (← links)
- Subgroup perfect codes in Cayley sum graphs (Q780380) (← links)
- More on limited packings in graphs (Q782753) (← links)
- Optimal tristance anticodes in certain graphs (Q817597) (← links)
- An almost complete description of perfect codes in direct products of cycles (Q864867) (← links)
- Weighted efficient domination in two subclasses of \(P_6\)-free graphs (Q908292) (← links)
- Perfect codes in direct products of cycles-a complete characterization (Q931836) (← links)
- Queen's domination using border squares and \((A,B)\)-restricted domination (Q942117) (← links)
- Quotients of Gaussian graphs and their application to perfect codes (Q975827) (← links)
- Perfect codes over graphs (Q1057833) (← links)
- On the nonexistence of nontrivial perfect e-codes and tight 2e-designs in Hamming schemes H(n,q) with e\(\geq 3\) and q\(\geq 3\) (Q1078149) (← links)
- On the parameters of codes for the Lee and modular distance (Q1176746) (← links)
- Two infinite classes of perfect codes in metrically regular graphs (Q1223320) (← links)
- An improved version of Lloyd's theorem (Q1227561) (← links)
- Nearly perfect codes in distance-regular graphs (Q1231470) (← links)
- On perfect codes in the Hamming schemes H(n,q) with q arbitrary (Q1237695) (← links)
- Nonexistence of nontrivial perfect codes in case \(q=p^r_1p^s_2\), \(e\geq 3\) (Q1241419) (← links)
- Efficient edge domination problems in graphs (Q1313728) (← links)
- Polynomial algorithms for the weighted perfect domination problems on chordal graphs and split graphs (Q1313745) (← links)
- Regular codes in regular graphs are difficult (Q1336698) (← links)
- Weighted efficient domination problem on some perfect graphs (Q1348388) (← links)
- Weighted domination of cocomparability graphs (Q1382270) (← links)
- Efficient dominating sets in Cayley graphs. (Q1406027) (← links)
- Tight 2-designs and perfect 1-codes in Doob graphs (Q1569871) (← links)
- Packing in trees (Q1584274) (← links)
- Cyclotomic graphs and perfect codes (Q1621577) (← links)
- A dichotomy for weighted efficient dominating sets with bounded degree vertices (Q1628682) (← links)
- Efficient location of resources in cylindrical networks (Q1646261) (← links)
- Bounding the open \(k\)-monopoly number of strong product graphs (Q1692650) (← links)
- Efficient absorbants in generalized de Bruijn digraphs (Q1751232) (← links)
- The existence of perfect codes in a family of generalized Fibonacci cubes (Q1799596) (← links)
- Polynomial-time algorithm for weighted efficient domination problem on diameter three planar graphs (Q1799604) (← links)
- Weighted efficient domination for some classes of \(H\)-free and of \((H_1, H_2)\)-free graphs (Q1801055) (← links)
- Perfect codes in the graphs \(O_k\) (Q1844190) (← links)
