Some graph properties of the Hamming and the Johnson schemes
The vertex set of the ith graph of the Johnson Scheme Gi(n,k) is the set of all k subsets of a fixed set of n elements. Two vertices A and B are i-related and are adjacent if and only if [A ^ B] = k-i. The combined ith graphs of the Johnson Scheme SGi(n) is the graph formed by the union of all the g...
| Yazar: | |
|---|---|
| Materyal Türü: | Tez |
| Dil: | English |
| Baskı/Yayın Bilgisi: |
2005.
|
| Konular: |