• The Transactions of the Korean Institute of Power Electronics
• /
• v.25 no.5
• /
• pp.395-403
• /
• 2020

This study presents a stable start-up strategy for v/f scalar-controlled permanent magnet synchronous motors (PMSMs). The v/f-controlled PMSMs easily lose synchronism under low-speed conditions if an insufficient stator voltage is applied to the machine due to errors in measured motor parameters and inverter nonlinearity, such as inverter dead time and on-state voltage drop. The proposed method adopts the I/f control method to ensure a stable start at low speeds and then switches to the v/f control method at medium speeds. A smooth transition method from I/f control to v/f control is proposed to minimize the oscillation of the stator current and rotor speed during transition. Moreover, the stability of the I/f and v/f control methods is analyzed using a small-signal model. Simulation and experimental results are provided to verify the performance of the proposed control strategy.

• Communications of the Korean Mathematical Society
• /
• v.31 no.1
• /
• pp.131-138
• /
• 2016

We determine the general solutions $f:\mathbb{R}^2{\rightarrow}\mathbb{R}$ of the functional equation f(ux-vy, uy+v(x+y)) = f(x, y)f(u, v) for all x, y, u, $v{\in}\mathbb{R}$. We also investigate both bounded and unbounded solutions of the functional inequality ${\mid}f(ux-vy,uy+v(x+y))-f(x,y)f(u,v){\mid}{\leq}{\phi}(u,v)$ for all x, y, u, $v{\in}\mathbb{R}$, where ${\ph}:\mathbb{R}^2{\rightarrow}\mathbb{R}_+$ is a given function.

• Communications of the Korean Mathematical Society
• /
• v.30 no.3
• /
• pp.313-325
• /
• 2015

An H-magic labeling in a H-decomposable graph G is a bijection $f:V(G){\cup}E(G){\rightarrow}\{1,2,{\cdots},p+q\}$ such that for every copy H in the decomposition, $\sum{_{{\upsilon}{\in}V(H)}}\;f(v)+\sum{_{e{\in}E(H)}}\;f(e)$ is constant. f is said to be H-V -super magic if f(V(G))={1,2,...,p}. In this paper, we prove that complete bipartite graphs $K_{n,n}$ are H-V -super magic decomposable where $$H{\sim_=}K_{1,n}$$ with $n{\geq}1$.

• Kyungpook Mathematical Journal
• /
• v.61 no.3
• /
• pp.661-669
• /
• 2021

For a simple, undirected graph G = (V, E), a perfect Roman dominating function (PRDF) f : V → {0, 1, 2} has the property that, every vertex u with f(u) = 0 is adjacent to exactly one vertex v for which f(v) = 2. The weight of a PRDF is the sum f(V) = ∑_v∈V f(v). The minimum weight of a PRDF is called the perfect Roman domination number, denoted by γ_R^P(G). Given a graph G and a positive integer k, the PRDF problem is to check whether G has a perfect Roman dominating function of weight at most k. In this paper, we first investigate the complexity of PRDF problem for some subclasses of bipartite graphs namely, star convex bipartite graphs and comb convex bipartite graphs. Then we show that PRDF problem is linear time solvable for bounded tree-width graphs, chain graphs and threshold graphs, a subclass of split graphs.

• Bulletin of the Korean Mathematical Society
• /
• v.39 no.2
• /
• pp.333-346
• /
• 2002

Let $F={F^v:S^1->S^1,v\in\; V$ and $g={G^v:S^1->S^1,v\in\; V$ be disjoint flows defined on the unit circle $S^1$, that is such flows that each their element either is the identity mapping or has no fixed point ((V, +) is a 2-divisible nontrivial abelian group). The aim of this paper is to give a necessary and sufficient codition for topological conjugacy of disjoint flows i.e., the existence of a homeomorphism $\Gamma:S^1->S^1$ satisfying $$\Gamma\circ\ F^v=G^v\circ\Gamma,\; v\in\; V$$ Moreover, under some further restrictions, we determine all such homeomorphisms.

• Journal of applied mathematics & informatics
• /
• v.40 no.5_6
• /
• pp.915-923
• /
• 2022

The purpose of the present paper is to obtain commutativity of prime Γ-near-ring N with generalized derivations F and G with associated derivations d and h respectively satisfying one of the following conditions:(i) G([x, y]α = ±f(y)α(xoy)βγg(y), (ii) F(x)βG(y) = G(y)βF(x), for all x, y ∈ N, β ∈ Γ (iii) F(u)βG(v) = G(v)βF(u), for all u ∈ U, v ∈ V, β ∈ Γ,(iv) if 0 ≠ F(a) ∈ Z(N) for some a ∈ V such that F(x)αG(y) = G(y)αF(x) for all x ∈ V and y ∈ U, α ∈ Γ.

• Journal of applied mathematics & informatics
• /
• v.10 no.1_2
• /
• pp.27-40
• /
• 2002

For two integers m, n with m $\leq$ n, an [m,n]-factor F in a graph G is a spanning subgraph of G with m $\leq$ d$\_$F/(v) $\leq$ n for all v ∈ V(F). In 1996, H. Enomoto et al. proved that every 3-connected Planar graph G with d$\_$G/(v) $\geq$ 4 for all v ∈ V(G) contains a [2,3]-factor. In this paper. we extend their result to all 3-connected locally finite infinite planar graphs containing no unbounded faces.

• East Asian mathematical journal
• /
• v.28 no.5
• /
• pp.579-585
• /
• 2012

Let D be a finite digraph with the vertex set V(D) and arc set A(D). A two-valued function $f:V(D){\rightarrow}\{-1,\;1\}$ defined on the vertices of a digraph D is called a signed 2-independence function if $f(N^-[v]){\leq}1$ for every $v$ in D. The weight of a signed 2-independence function is $f(V(D))=\sum\limits_{v{\in}V(D)}\;f(v)$. The maximum weight of a signed 2-independence function of D is the signed 2-independence number ${\alpha}_s{^2}(D)$ of D. Recently, Volkmann [3] began to investigate this parameter in digraphs and presented some upper bounds on ${\alpha}_{s}^{2}(D)$ for general digraph D. In this paper, we improve upper bounds on ${\alpha}_s{^2}(D)$ given by Volkmann [3].

• Journal of applied mathematics & informatics
• /
• v.35 no.5_6
• /
• pp.565-586
• /
• 2017

In this paper we continue to investigate the Super Vertex Mean behaviour of all graphs up to order 5 and all regular graphs up to order 7. Let G(V,E) be a graph with p vertices and q edges. Let f be an injection from E to the set {1,2,3,${\cdots}$,p+q} that induces for each vertex v the label defined by the rule $f^v(v)=Round\;\left({\frac{{\Sigma}_{e{\in}E_v}\;f(e)}{d(v)}}\right)$, where $E_v$ denotes the set of edges in G that are incident at the vertex v, such that the set of all edge labels and the induced vertex labels is {1,2,3,${\cdots}$,p+q}. Such an injective function f is called a super vertex mean labeling of a graph G and G is called a Super Vertex Mean Graph.

• Communications of the Korean Mathematical Society
• /
• v.33 no.4
• /
• pp.1125-1140
• /
• 2018

Let A be a normed space, ${\mathcal{B}}(A)$ the algebra of all bounded operators on A, and V a family of strongly upper semicontinuous functions from a Hausdorff completely regular space X into ${\mathcal{B}}(A)$. In this paper, we investigate some properties of the weighted spaces CV (X, A) of all A-valued continuous functions f on X such that the mapping $x{\mapsto}v(x)(f(x))$ is bounded on X, for every $v{\in}V$, endowed with the topology generated by the seminorms ${\parallel}f{\parallel}v={\sup}\{{\parallel}v(x)(f(x)){\parallel},\;x{\in}X\}$. Our main purpose is to characterize continuous, bounded, and locally equicontinuous weighted composition operators between such spaces.