#### Filter Results:

- Full text PDF available (4)

#### Publication Year

2002

2018

- This year (2)
- Last 5 years (5)
- Last 10 years (11)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Byeong Moon Kim, Byung Chul Song, Woonjae Hwang
- Appl. Math. Lett.
- 2009

- Sung-Ik Sohn, Daeki Yoon, Woonjae Hwang
- Physical review. E, Statistical, nonlinear, and…
- 2010

The nonlinear evolution of an interface subject to a parallel shear flow is studied by the vortex sheet model. We perform long-time computations for the vortex sheet in density-stratified fluids by using the point vortex method and investigate late-time dynamics of the Kelvin-Helmholtz instability. We apply an adaptive point insertion procedure and a… (More)

- Woonjae Hwang, W. Brent Lindquist
- SIAM J. Math. Analysis
- 2002

We construct the solutions to a two-dimensional (2-D) Riemann problem for a 2× 2 hyperbolic nonlinear system which models polymer flooding in an anisotropic oil reservoir. The construction demonstrates the importance of the shock, rarefaction, and contact “base points” and “base curves” in the determination of the solutions for 2-D Riemann problems. In… (More)

The Klee-Quaife problem is finding the minimum order μ(d, c, v) of the (d, c, v) graph, which is a c-vertex connected v-regular graph with diameter d. Many authors contributed finding μ(d, c, v) and they also enumerated and classified the graphs in several cases. This problem is naturally extended to the case of digraphs. So we are interested in the… (More)

The exponent of the strong product of a digraph of order m and a digraph of order n is shown to be bounded above by m+n− 2, with equality for Zm ⊠Zn. The exponent and diameter of the strong product of a graph and a digraph are also investigated.

- Byeong Moon Kim, Woonjae Hwang, Byung Chul Song
- J. Comb. Optim.
- 2015

A multilevel distance labeling of a graph G = (V, E) is a function f on V intoN∪{0} such that | f (v)− f (w)| ≥ diam(G)+1−dist(v,w) for all v,w ∈ V . The radio number rn(G) of G is the minimum span over all multilevel distance labelings of G. In this paper, we completely determine the radio number rn(G) of G where G is the Cartesian product of a path Pn… (More)

- Jinah Hwang, Myoungin Shin, Suyeon Shin, Woonjae Hwang
- Applied Mathematics and Computation
- 2018

- Byeong Moon Kim, Yoomi Rho, Byung Chul Song, Woonjae Hwang
- Discrete Mathematics
- 2012

- Woonjae Hwang, W. Brent Lindquist
- SIAM J. Math. Analysis
- 2002

The exponent of the strong product of a digraph of order m and a digraph of order n is shown to be bounded above by m+n− 2, with equality for Zm ⊠Zn. The exponent and diameter of the strong product of a graph and a digraph are also investigated.