• Journal of applied mathematics & informatics
• /
• v.24 no.1_2
• /
• pp.357-366
• /
• 2007

Let G(V, E) be a simple graph, and let f be an integer function on V with $1{\leq}f(v){\leq}d(v)$ to each vertex $v{\in}V$. An f-edge cover-coloring of a graph G is a coloring of edge set E such that each color appears at each vertex $v{\in}V$ at least f(v) times. The f-edge cover chromatic index of G, denoted by ${\chi}'_{fc}(G)$, is the maximum number of colors such that an f-edge cover-coloring of G exists. Any simple graph G has an f-edge cover chromatic index equal to ${\delta}_f\;or\;{\delta}_f-1,\;where\;{\delta}_f{=}^{min}_{v{\in}V}\{\lfloor\frac{d(v)}{f(v)}\rfloor\}$. Let G be a connected and not complete graph with ${\chi}'_{fc}(G)={\delta}_f-1$, if for each $u,\;v{\in}V\;and\;e=uv{\nin}E$, we have ${\chi}'_{fc}(G+e)>{\chi}'_{fc}(G)$, then G is called an f-edge covered critical graph. In this paper, some properties on f-edge covered critical graph are discussed. It is proved that if G is an f-edge covered critical graph, then for each $u,\;v{\in}V\;and\;e=uv{\nin}E$ there exists $w{\in}\{u,v\}\;with\;d(w)\leq{\delta}_f(f(w)+1)-2$ such that w is adjacent to at least $d(w)-{\delta}_f+1$ vertices which are all ${\delta}_f-vertex$ in G.

• The Transactions of the Korean Institute of Electrical Engineers B
• /
• v.53 no.6
• /
• pp.402-408
• /
• 2004

This paper proposes the novel V/f control method to improve the stability of a V/f controlled induction motor drive system. The conventional V/f control method used in the proposed V/f control method is a vector-based method that is slightly different from the existing conventional V/f control method. The proposed control method uses a dynamic current compensator to improve the stability of a V/f controlled induction motor drive system. This proposed method is easy to implement and completely eliminates the motor oscillation phenomenon causing the instability of a V/f controlled induction motor drive system, especially when the system is driven near the resonant frequency in steady-state with light load. Additionally, this paper analyzes theoretically the instability of a V/f controlled induction motor drive system and shows the validity of the Proposed V/f control method through simulation and experimental results.

• Journal of the Korean Mathematical Society
• /
• v.48 no.1
• /
• pp.105-115
• /
• 2011

Let f be a function which assigns a positive integer f(v) to each vertex v $\in$ V (G), let r, s and t be non-negative integers. An f-coloring of G is an edge-coloring of G such that each vertex v $\in$ V (G) has at most f(v) incident edges colored with the same color. The minimum number of colors needed to f-color G is called the f-chromatic index of G and denoted by ${\chi}'_f$(G). An [r, s, t; f]-coloring of a graph G is a mapping c from V(G) $\bigcup$ E(G) to the color set C = {0, 1, $\ldots$; k - 1} such that |c($v_i$) - c($v_j$ )| $\geq$ r for every two adjacent vertices $v_i$ and $v_j$, |c($e_i$ - c($e_j$)| $\geq$ s and ${\alpha}(v_i)$ $\leq$ f($v_i$) for all $v_i$ $\in$ V (G), ${\alpha}$ $\in$ C where ${\alpha}(v_i)$ denotes the number of ${\alpha}$-edges incident with the vertex $v_i$ and $e_i$, $e_j$ are edges which are incident with $v_i$ but colored with different colors, |c($e_i$)-c($v_j$)| $\geq$ t for all pairs of incident vertices and edges. The minimum k such that G has an [r, s, t; f]-coloring with k colors is defined as the [r, s, t; f]-chromatic number and denoted by ${\chi}_{r,s,t;f}$ (G). In this paper, we present some general bounds for [r, s, t; f]-coloring firstly. After that, we obtain some important properties under the restriction min{r, s, t} = 0 or min{r, s, t} = 1. Finally, we present some problems for further research.

• Journal of Sericultural and Entomological Science
• /
• v.30 no.1
• /
• pp.33-39
• /
• 1988

In the case of white cocoon, the fluorescence colors are classified as a yellowish fluorescence cocoon(Y.F.C.) and a violet fluorescence cocoon(V.F.C.) by exposing to ultra-violet ray. Accordingly, experiments were carried out to investigate the difference of sericin behaviors between Y.F.C. and V.F.C. by measuring the sericin solubility, surface tension and viscosity of the sericin solution. Also, the reelability of two different type of cocoons was investigated in the silk reeling process. The results were summarized as follows; 1. The sericin solubility of Y.F.C. shell is higher than that of V.F.C. shell with the dissolution temperature and time. It is shown that the sericin solubility curves of Y.F.c. and V.F.C. are similar in shape, but the difference of sericin solubility between Y.F.C. and V.F.C. is more significant at higher bath temperature. 2. The initial sericin dissolution curves of Y.F.C. and V.F.C. cocoon shell can be divided by four parts within the range of dissolving time from 5 minutes to 60 minutes. The initial dissolution velocity of Y.F.C. shell is faster than that of V.F.C. but the velocity difference is negligible after 30 minutes of dissolving time. 3. The gelation of V.F.C. sericin solution is faster than that of Y.F.C. at early stage(in the range of 15 minutes to 60 minutes). 4. In the silk reeling process, the reelability of Y.F.C. is better than that of V.F.C. with about 11%. This is mainly due to the higher sericin solubility in Y.F.C. followed by the fast dissolution velocity.

• The KIPS Transactions:PartA
• /
• v.18A no.6
• /
• pp.225-232
• /
• 2011

Restricted Hypercube-Like (RHL) graphs are a graph class that widely includes useful interconnection networks such as crossed cube, Mobius cube, Mcube, twisted cube, locally twisted cube, multiply twisted cube, and generalized twisted cube. In this paper, we show that for an m-dimensional RHL graph G, $m{\geq}4$, with an arbitrary faulty edge set $F{\subset}E(G)$, ${\mid}F{\mid}{\leq}m-2$, graph $G{\setminus}F$ has a hamiltonian path between any distinct two nodes s and t if dist(s, V(F))${\neq}1$ or dist(t, V(F))${\neq}1$. Graph $G{\setminus}F$ is the graph G whose faulty edges are removed. Set V(F) is the end vertex set of the edges in F and dist(v, V(F)) is the minimum distance between vertex v and the vertices in V(F).

• Journal of applied mathematics & informatics
• /
• v.19 no.1_2
• /
• pp.127-133
• /
• 2005

An f-coloring of a graph G = (V, E) is a coloring of edge set E such that each color appears at each vertex v $\in$ V at most f(v) times. The minimum number of colors needed to f-color G is called the f-chromatic index $\chi'_f(G)$ of G. Any graph G has f-chromatic index equal to ${\Delta}_f(G)\;or\;{\Delta}_f(G)+1,\;where\;{\Delta}_f(G)\;=\;max\{{\lceil}\frac{d(v)}{f(v)}{\rceil}\}$. If $\chi'_f(G)$= ${\Delta}$f(G), then G is of $C_f$ 1 ; otherwise G is of $C_f$ 2. In this paper, the classification problem of complete graphs on f-coloring is solved completely.

• Journal of the Korean Mathematical Society
• /
• v.43 no.2
• /
• pp.311-322
• /
• 2006

For the Briot-Bouquet differential equations of the form given in [1] $${{\mu}(z)+\frac {z{\mu}'(z)}{z\frac {f'(z)}{f(z)}\[\alpha{\mu}(z)+\beta]}=g(z)$$ we can reduce them to $${{\mu}(z)+F(z)\frac {v'(z)}{v(z)}=h(z)$$ where $$v(z)=\alpha{\mu}(z)+\beta,\;h(z)={\alpha}g(z)+\beta\;and\;F(z)=f(z)/f'(z)$$. In this paper we are going to give conditions in order that if u and v satisfy, respectively, the equations (1) $${{\mu}(z)+F(z)\frac {v'(z)}{v(z)}=h(z)$$, $${{\mu}(z)+G(z)\frac {v'(z)}{v(z)}=g(z)$$ with certain conditions on the functions F and G applying the concept of strong subordination $g\;\prec\;\prec\;h$ given in [2] by the author, implies that $v\;\prec\;{\mu},\;where\;\prec$ indicates subordination.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.8
• /
• pp.2124-2132
• /
• 1999

Given a graph G=(V,E), Ld(2,1)-labeling of G is a function f : V(G)$\longrightarrow$[0,$\infty$) such that, if v1,v2$\in$V are adjacent, $\mid$ f(x)-f(y) $\mid$$\geq$2d, and, if the distance between and is two, $\mid$ f(x)-f(y) $\mid$$\geq$d, where dG(,v2) is shortest distance between v1 and in G. The L(2,1)-labeling number (G) is the smallest number m such that G has an L(2,1)-labeling f with maximum m of f(v) for v$\in$V. This problem has been studied by Griggs, Yeh and Sakai for the various classes of graphs. In this paper, we discuss the upper-bound of ${\lambda}$ (G) for a chordal graph G and that of ${\lambda}$(G') for a permutation graph G'.

• 제어로봇시스템학회:학술대회논문집
• /
• 2000.10a
• /
• pp.31-31
• /
• 2000

In this paper, Ive design and test the V/F converter for KSR-III INS using commertial INC, VFC110, AD652. The test result shows that performance of AD652 is better than that of VFC110. Through the calibration of V/F converter, we show that the designed V/F converter has a good performance and is usable for KSR-III.

• Proceedings of the KIPE Conference
• /
• 2014.07a
• /
• pp.375-376
• /
• 2014

본 논문은 전동기의 V/F 운전시 발생하는 경부하 진동을 억제하는 방법을 제안한다. 제안한 방법은 기존의 무부하 전류를 사용하는 방법을 변형하여 V/F 운전시 전원 및 기계적 진동에 의해 발생하는 경부하 진동을 억제하여 운전 특성을 향상시킨다. 제안한 방법을 적용한 V/F 운전 특성을 실험을 통하여 검증하고 기존의 V/F 운전 대비 개선된 성능을 비교 분석한다.