Zobrazeno 1 - 7
of 7
pro vyhledávání: '"Dae-Keun Lim"'
Publikováno v:
East Asian mathematical journal. 30:123-148
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a7bf1a0e1d4c8bf9f4d204735b3cb985
https://doi.org/10.7858/eamj.2014.010
https://doi.org/10.7858/eamj.2014.010
Autor:
Dae-Keun Lim, Hyun-Jung Kim
Publikováno v:
East Asian Mathematical Journal. 28:353-361
In this paper, we apply mathematising activities to geometry contents of corrent in middle and high school in order to actualize learning and teaching through Freudenthal`s, Piaget`s, and Van Hieles`s mathematising among many theories affecting teach
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::63fc68c689d5ea669e3a011587ca8553
https://doi.org/10.7858/eamj.2012.028
https://doi.org/10.7858/eamj.2012.028
Autor:
Dae-Keun Lim
Publikováno v:
Kyungpook mathematical journal. 48:331-335
In this paper, we investigate the number of ones in rows of Pascal's Rectangle. Using these results, we determine the existence of regular bipartite Steinhaus graphs. Also, we give an upper bound for the minimum degree of bipartite Steinhaus graphs.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::63331d8a14e2766f6f587de4ac738958
https://doi.org/10.5666/kmj.2008.48.2.331
https://doi.org/10.5666/kmj.2008.48.2.331
Autor:
Dongju Kim, Dae-Keun Lim
Publikováno v:
Discrete Mathematics. 256(1-2):257-265
The numbers of 2-connected and 2-edge-connected Steinhaus graphs with n vertices are determined for n⩾6. The possible generating strings of 2-connected and 2-edge-connected Steinhaus graphs are classified.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::07fe9c6d22be72565284b114daaa7bcf
Publikováno v:
Graphs and Combinatorics. 15:327-336
A permutation graph over a graph was introduced by Lee and Sohn in [8] as a generalization of both a graph bundle over a graph and a standard permutation graph, and they gave a characterization of a natural isomorphism and an automorphism of a given
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3f606eb625a3e736373f95a70365aa26
https://doi.org/10.1007/s003730050066
https://doi.org/10.1007/s003730050066
Autor:
Kyu-Taek Lee, Joung-Soon Jang, Dae-Keun Lim, Nyun Jong Lee, In-Tae Hwang, Ju-Won Kang, Jun-Seong Yoon, Eun Mi Nam, Won Jongwoo, Suyeon Lee, Sung-Hwa Oh, Deukjo Hong, Sujin Bae, Seo-Young Song, Hyung-Jin Lee, Sue-Young Lee, Hyun-Gyu Lee, Kyusoon Kim, Hyun Jung Kim, Han Jo Kim
Publikováno v:
European Journal of Cancer. 51:S456
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7550ef09b1418ee4705d2cf490ad8344
https://doi.org/10.1016/s0959-8049(16)31277-1
https://doi.org/10.1016/s0959-8049(16)31277-1
Autor:
Dae-Keun Lim
Publikováno v:
Discrete Mathematics. (13-14):1912-1917
In this paper, we define four types of clique in Steinhaus graphs and classify the generating strings of those n-vertex Steinhaus graphs whose maximum cliques have size @[email protected]?, which is the maximum possible. Also, we give the number of s
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e9c325427403fad896d7d928f478572c