• Journal of applied mathematics & informatics
• /
• 제24권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.

• 대한전기학회논문지:전기기기및에너지변환시스템부문B
• /
• 제53권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.

• 대한수학회지
• /
• 제48권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.

• 한국잠사곤충학회지
• /
• 제30권1호
• /
• pp.33-39
• /
• 1988

본 시험은 자외선에 의해 구분된 황형광색견(Y.F.C)와 자형광색견(V.F.C)의 견층 sericin이 열수에 대한 성질과 견층 sericin 수용액의 물리적 성질 차이를 조사하고 제사성적에 미치는 영향을 검토한 결과를 요약하면 다음과 같다. 1. 용해온도에 따른 sericin의 용해성은 낮은 온도에서보다 높은 온도에서 Y.F.C와 V.F.C간의 차가 켰다. 2. 용해시간에 따른 sericin의 용해성은 Y.F.C 및 V.F.C 모두 비슷한 경향을 나타냈으나 Y.F.C가 V.F.C. 보다 용해성이 좋았다. 3. 초기 sericin 용해성을 도시하면 용해도가 다른 4개 부분으로 구분할 수 있었고 Y.F.C 및 V.F.C 모두 같은 형태였으나 각 용해속도에 있어서는 차이가 있었다. 4. Sericin 수용액의 표면장력 측정결과 처리후 방치 시간에 따른 변화 속도는 45분 이내에서 V.F.C가 빠르기 때문에 sericin의 용해성을 저하시킬 것으로 사료된다. 5. Sericin 입자의 비용적에 있어서 Y.F.C가 V.F.C 보다 크기 때문에 Y.F.C의 용해성이 좋은 것으로 추정된다. 6. 제사가공 중 견층 sericin 용해량은 Y.F.C가 V.F.C 보다 초기용해속도가 빠르기 때문에 전공정 sericin 유실량이 많았고 이 때문에 실켜기 공정에서 고치실의 풀림새를 향상시킨 것으로 사료된다.

• 정보처리학회논문지A
• /
• 제18A권6호
• /
• pp.225-232
• /
• 2011

Restricted Hypercube-Like(RHL) 그래프는 교차큐브, 뫼비우스큐브, 엠큐브, 꼬인큐브, 지역꼬인큐브, 다중꼬인큐브, 일반꼬인큐브와 같이 유용한 상호연결망들을 광범위하게 포함하는 그래프군이다. 본 논문에서는 $m{\geq}4$ 인 m-차원 RHL 그래프 G에 대해서 임의의 에지 집합 $F{\subset}E(G)$, ${\mid}F{\mid}{\leq}m-2$, 가 고장일 때, 고장 에지들을 제거한 그래프 $G{\setminus}F$는 임의의 서로 다른 두 정점 s와 t에 대해서 dist(s, V(F))${\neq}1$ 이거나 dist(t, V(F))${\neq}1$이면 해밀톤 경로가 있음을 보인다. V(F)는 F에 속하는 에지들의 양 끝점들의 집합이고 dist(v, V(F))는 정점 v와 집합 V(F)의 정점들 간의 최소 거리이다.

• Journal of applied mathematics & informatics
• /
• 제19권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.

• 대한수학회지
• /
• 제43권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.

• 한국정보처리학회논문지
• /
• 제6권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년도 제15차 학술회의논문집
• /
• 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.

• 전력전자학회:학술대회논문집
• /
• 전력전자학회 2014년도 전력전자학술대회 논문집
• /
• pp.375-376
• /
• 2014

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