Aeryung Moon An Analogue of the Erdös-Ko-Rado Theorem for the Hamming Schemes H(n, q). [Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. A, 1982, v:32, n:3, pp:386-390 [Journal]

Aeryung Moon Characterization of the graphs of the Johnson schemes G(3k, k) and G(3k + 1, k). [Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. B, 1982, v:33, n:3, pp:213-221 [Journal]

Aeryung Moon On the uniqueness of the graphs G(n, k) of the Johnson schemes. [Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. B, 1982, v:33, n:3, pp:256-264 [Journal]

Aeryung Moon The graphs G(n, k) of the Johnson Schemes are unique for n geq 20. [Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. B, 1984, v:37, n:2, pp:173-188 [Journal]

Aeryung Moon An embedding theorem for affine resolvable designs. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1982, v:40, n:2-3, pp:255-259 [Journal]

Aeryung Moon Characterization of the odd graphs O_{k} by parameters. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1982, v:42, n:1, pp:91-97 [Journal]

Search in 0.002secs, Finished in 0.003secs

NOTICE1

System may not be available sometimes or not working properly, since it is still in development with continuous upgrades

NOTICE2

The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP