## Congressus Numerantium, Volume 186 |

### What people are saying - Write a review

We haven't found any reviews in the usual places.

### Common terms and phrases

0-1 subgraph adjacency matrix algorithm An,k antiautomorphism approximation formulas assume automorphism balanced biclique cover binary bond percolation clique CmXCm-Sk codewords of length compositions CONGRESSUS NUMERANTIUM 186 consider Corollary cycle of length dd(T defined deleted denote digraph directed cycle directed graph disjoint DTS(v edge control set edge labeled edit codes Figure finite free edge control graceful labeling graph G Hamiltonian cycle Hamming distance Hence initial vertex insertion-deletion correcting codes integer isomorphic lattices leave vertices Xj Lemma Let G linear code Lyndon words Math Mathematics maximum stable set minimal edge control number of codewords O-arrays optimal out-tournament panel structure percolation thresholds perimeter Proof rank secret sharing secret sharing scheme set of G site percolation star graphs strong components summand symbol Theorem tree unbordered words upset path upset tournament v-e-f sets variable-length vertical edge well-covered graphs windmill graph words of length