• Korean Journal of Weed Science
• /
• v.8 no.3
• /
• pp.237-243
• /
• 1988

Field study was conducted to evaluate safening effect of fenclorim (4,6-dichloro-2-phenyl pyrimidine) against benthiocarb, butachlor, and pretilachlor injury in rice plants under vinyl-covered subirrigated seedbed. Combinated application of benthiocarb 210, and 315 g ai/10a with fenclorim 10 g ai/10a or higher concentration, butachlor 180, and 270 g ai/10a with fenclorim 20 g ai/10a or higher concentration, and pretilachlor 60, and 90 g ai/10a with fenclorim 30 g ai/10a reduced herbicide injury of rice, and thus increased standing, plant height, tillers, and dry weight of rice plants compared to no combined application of fenclorim.

• Journal of the Korean Data and Information Science Society
• /
• v.26 no.3
• /
• pp.677-685
• /
• 2015

Disease of human and economic traits of livestocks are affected a lot by gene combination effect rather than a single gene effect. In this study, we used SNPHarvester method that supplement existing method in order to investigate the interaction of these genes. The used genes are SREBPs (g.3270+10274 C>T, g.13544 T>C) and FABP4 (g.2634+1018 A>T, g.2988 A>G, g.3690 G>A, g.3710 G>C, g.3977-325 T>C, g.4221 A>G) that are closely related to the fatty acid composition affecting the meatiness of Korean cattle. The economic traits which are used are oleic acid (C18:1), monounsaturated fatty acid (MUFA), marbling score (MS). First, we have utilized the SNPHarvester method in order to find excellent gene combination, and then used the multifactor dimensionality reduction method in order to identify excellent genotype in gene combination.

• Kyungpook Mathematical Journal
• /
• v.63 no.2
• /
• pp.167-173
• /
• 2023

Let G be a finite group and let ν(G) be the probability that two randomly selected elements of G produce a nilpotent group. In this article we show that for every positive integer n > 0, there is a finite group G such that ${\nu}(G)={\frac{1}{n}}$. We also classify all groups G with ${\nu}(G)={\frac{1}{2}}$. Further, we prove that if G is a solvable nonnilpotent group of even order, then ${\nu}(G){\leq}{\frac{p+3}{4p}}$, where p is the smallest odd prime divisor of |G|, and that equality exists if and only if $\frac{G}{Z_{\infty}(G)}$ is isomorphic to the dihedral group of order 2p where Z_∞(G) is the hypercenter of G. Finally we find an upper bound for ν(G) in terms of |G| where G ranges over all groups of odd square-free order.

• Bulletin of the Korean Mathematical Society
• /
• v.33 no.1
• /
• pp.75-86
• /
• 1996

Let G be a finite simple connected graph with vertex set V(G) and edge set E(G). Let A(G) be the adjacency matrix of G. The characteristic polynomial of G is the characteristic polynomial $\Phi(G;\lambda) = det(\lambda I - A(G))$ of A(G). A zero of $\Phi(G;\lambda)$ is called an eigenvalue of G.

• Journal of applied mathematics & informatics
• /
• v.27 no.5_6
• /
• pp.1157-1163
• /
• 2009

Let G be a graph with vertex set V(G) and let f be a nonnegative integer-valued function defined on V(G). A spanning subgraph F of G is called a fractional f-factor if $d^h_G$(x)=f(x) for all x $\in$ for all x $\in$ V (G), where $d^h_G$ (x) = ${\Sigma}_{e{\in}E_x}$ h(e) is the fractional degree of x $\in$ V(F) with $E_x$ = {e : e = xy $\in$ E|G|}. In this paper it is proved that if ${\delta}(G){\geq}{\frac{b^2(k-1)}{a}},\;n>\frac{(a+b)(k(a+b)-2)}{a}$ and $|N_G(x_1){\cup}N_G(x_2){\cup}{\cdots}{\cup}N_G(x_k)|{\geq}\frac{bn}{a+b}$ for any independent subset ${x_1,x_2,...,x_k}$ of V(G), then G has a fractional f-factor. Where k $\geq$ 2 be a positive integer not larger than the independence number of G, a and b are integers such that 1 $\leq$ a $\leq$ f(x) $\leq$ b for every x $\in$ V(G). Furthermore, we show that the result is best possible in some sense.

• Journal of applied mathematics & informatics
• /
• v.22 no.1_2
• /
• pp.435-440
• /
• 2006

Let G be a simple graph with vertex set V(G) and edge set E(G). A subset S of E(G) is called an edge cover of G if the subgraph induced by S is a spanning subgraph of G. The maximum number of edge covers which form a partition of E(G) is called edge covering chromatic number of G, denoted by X'c(G). It is known that for any graph G with minimum degree ${\delta},\;{\delta}-1{\le}X'c(G){\le}{\delta}$. If $X'c(G) ={\delta}$, then G is called a graph of CI class, otherwise G is called a graph of CII class. It is easy to prove that the problem of deciding whether a given graph is of CI class or CII class is NP-complete. In this paper, we consider the classification of nearly bipartite graph and give some sufficient conditions for a nearly bipartite graph to be of CI class.

• Communications of the Korean Mathematical Society
• /
• v.31 no.3
• /
• pp.637-645
• /
• 2016

For a polygon P, we consider the centroid $G_0$ of the vertices of P, the centroid $G_1$ of the edges of P and the centroid $G_2$ of the interior of P, respectively. When P is a triangle, the centroid $G_0$ always coincides with the centroid $G_2$. For the centroid $G_1$ of a triangle, it was proved that the centroid $G_1$ of a triangle coincides with the centroid $G_2$ of the triangle if and only if the triangle is equilateral. In this paper, we study the relationships between the centroids $G_0$, $G_1$ and $G_2$ of a quadrangle P. As a result, we show that parallelograms are the only quadrangles which satisfy either $G_0=G_1$ or $G_0=G_2$. Furthermore, we establish a characterization theorem for convex quadrangles satisfying $G_1=G_2$, and give some examples (convex or concave) which are not parallelograms but satisfy $G_1=G_2$.

• Journal of the Korean Society of Food Culture
• /
• v.12 no.1
• /
• pp.79-86
• /
• 1997

Well-balanced meal is very important in its quantity and quality. Especially on the quantity field it becomes difficult for a foodservice operation to decide proper portion for individuals uniformly. These study was focused to setting up a proper portion by each food service operation. The results obtained were: 1. Individual consumption size from dormitory food service of college: cooked rice 282 g, soups 161 g, pot stewes 162 g, stir fries 53 g, stews 32 g, kimchies 47 g, fresh and boiled salads 43 g, one course dishies 477 g, pan broiles 44 g, meunieres 124 g. Individual consumption size from industry foodservice (white collar worker): cooked rices 228 g, soups 205 g, pot stewes 251 g, stir fries 20 g, stewes 76 g, kimchies 57 g, fresh and boiled salads 36 g, one course dishies 423 g, pan broiles 63 g, meunieres 38 g. 2. Proper portion of meal based on a statistical data is as follows: at college foodservice - cooked rices $280{\sim}290$ g, soups $155{\sim}170$ g, pot stewes 170 g, stir fries 60 g, stewes 35 g, kimchies $40{\sim}60$ g, fresh and boiled salads 50 g, one course dishies 480 g, pan broiles 50 g, meunieres 130 g and at industry foodservice (white collar worker) - cooked rices $220{\sim}250$ g, soups 210 g, pot stewes 250 g, stir fries 20 g, stewes 80 g, kimchies 60 g, fresh and boiled salads 40 g, one course dishies 430 g, pan broiles 70 g, meunieres 40 g.

• Journal of applied mathematics & informatics
• /
• v.39 no.1_2
• /
• pp.223-237
• /
• 2021

Let G = (V (G), E(G)) be a graph and let g : V (G) → S3 be a function. For each edge xy assign the label r where r is the remainder when o(g(x)) is divided by o(g(y)) or o(g(y)) is divided by o(g(x)) according as o(g(x)) ≥ o(g(y)) or o(g(y)) ≥ o(g(x)). The function g is called a group S3 cordial remainder labeling of G if |vg(i)-vg(j)| ≤ 1 and |eg(1)-eg(0)| ≤ 1, where vg(j) denotes the number of vertices labeled with j and eg(i) denotes the number of edges labeled with i (i = 0, 1). A graph G which admits a group S3 cordial remainder labeling is called a group S3 cordial remainder graph. In this paper, we prove that square of the path, duplication of a vertex by a new edge in path and cycle graphs, duplication of an edge by a new vertex in path and cycle graphs and total graph of cycle and path graphs admit a group S3 cordial remainder labeling.

• Journal of the Korean Mathematical Society
• /
• v.40 no.2
• /
• pp.225-239
• /
• 2003

(G, <) is an ordered group if'<'is a total order relation on G in which f < g implies that xfy < xgy for all f, g, x, y $\in$ G. We say that (G, <) is centrally ordered if (G, <) is ordered and ［G,D］ $\subseteq$ C for every convex jump C $\prec$ D in G. Equivalently, if $f^{-1}g f{\leq} g^2$ for all f, g $\in$ G with g > 1. Every order on a torsion-free locally nilpotent group is central. We prove that if every order on every two-generator subgroup of a locally soluble orderable group G is central, then G is locally nilpotent. We also provide an example of a non-nilpotent two-generator metabelian orderable group in which all orders are central.