Zobrazeno 1 - 10
of 72
pro vyhledávání: '"Park, Jeongmi"'
Autor:
Park, Jeongmi, Park, Hyeyeon, Jang, Jun-U, Kim, Hyunjung, Park, Hyeona, Iqbal, Tahir, Oh, Hyun-Suk, Choo, Kwang-Ho, Lee, Kibaek
Publikováno v:
In Bioresource Technology July 2024 403
Autor:
Park, Hyeyeon, Jang, Jun-U, Park, Jeongmi, Park, Hyeona, Choo, Kwang-Ho, Jeon, Jongho, Yeo, Hyeonuk, Lee, Chung-Hak, Lee, Kibaek
Publikováno v:
In Chemical Engineering Journal 15 April 2024 486
Autor:
Kim, In, Jang, Jun-U, Park, Hyeyeon, Park, Jeongmi, Oh, Hyun-Suk, Lee, Seonki, Choo, Kwang-Ho, Park, Pyung-Kyu, Lee, Kibaek
Publikováno v:
In Journal of Water Process Engineering April 2023 52
The notion of travel groupoids was introduced by L. Nebesk\'y in 2006 in connection with a study on geodetic graphs. A travel groupoid is a pair of a set $V$ and a binary operation $*$ on $V$ satisfying two axioms. For a travel groupoid, we can assoc
Externí odkaz:
http://arxiv.org/abs/1512.00363
Autor:
Park, Jeongmi, Sano, Yoshio
Publikováno v:
Discrete Mathematics and Theoretical Computer Science, Vol. 17, No. 2 (2015) 303-310
In this article, we introduce the notion of the double competition multigraph of a digraph. We give characterizations of the double competition multigraphs of arbitrary digraphs, loopless digraphs, reflexive digraphs, and acyclic digraphs in terms of
Externí odkaz:
http://arxiv.org/abs/1307.5509
Autor:
Park, Jeongmi, Sano, Yoshio
Publikováno v:
Discussiones Mathematicae Graph Theory 34 (2014) 353-359
The niche graph of a digraph $D$ is the (simple undirected) graph which has the same vertex set as $D$ and has an edge between two distinct vertices $x$ and $y$ if and only if $N^+_D(x) \cap N^+_D(y) \neq \emptyset$ or $N^-_D(x) \cap N^-_D(y) \neq \e
Externí odkaz:
http://arxiv.org/abs/1304.5476
Autor:
Park, Jeongmi, Sano, Yoshio
Publikováno v:
In Discrete Applied Mathematics 20 November 2015 195:110-113
Autor:
Park Jeongmi, Sano Yoshio
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 34, Iss 2, Pp 353-359 (2014)
The niche graph of a digraph D is the (simple undirected) graph which has the same vertex set as D and has an edge between two distinct vertices x and y if and only if N+D(x) ∩ N+D(y) ≠ ∅ or N−D(x) ∩ N−D(y) ≠ ∅, where N+D(x) (resp. N
Externí odkaz:
https://doaj.org/article/95160774610e4517a72ec4a5b074dc00
Autor:
Kim, Yang Hyun, Lee, Pyung Bok, Park, Jeongmi, Lim, Young Jin, Kim, Yong Chul, Lee, Sang Chul, Ahn, Wonsik
Publikováno v:
In Neurotoxicology December 2011 32(6):864-870