| |
| 1984 | ||
|---|---|---|
| 6 | EE | Aeryung Moon: The graphs G(n, k) of the Johnson Schemes are unique for n geq 20. J. Comb. Theory, Ser. B 37(2): 173-188 (1984) |
| 1982 | ||
| 5 | EE | Aeryung Moon: An embedding theorem for affine resolvable designs. Discrete Mathematics 40(2-3): 255-259 (1982) |
| 4 | EE | Aeryung Moon: Characterization of the odd graphs Ok by parameters. Discrete Mathematics 42(1): 91-97 (1982) |
| 3 | Aeryung Moon: An Analogue of the Erdös-Ko-Rado Theorem for the Hamming Schemes H(n, q). J. Comb. Theory, Ser. A 32(3): 386-390 (1982) | |
| 2 | EE | Aeryung Moon: Characterization of the graphs of the Johnson schemes G(3k, k) and G(3k + 1, k). J. Comb. Theory, Ser. B 33(3): 213-221 (1982) |
| 1 | EE | Aeryung Moon: On the uniqueness of the graphs G(n, k) of the Johnson schemes. J. Comb. Theory, Ser. B 33(3): 256-264 (1982) |