Home Topics on data transmission problem in software definition network
Article Open Access

Topics on data transmission problem in software definition network

  • Wei Gao EMAIL logo , Li Liang , Tianwei Xu and Jianhou Gan
Published/Copyright: August 3, 2017

Abstract

In normal computer networks, the data transmission between two sites go through the shortest path between two corresponding vertices. However, in the setting of software definition network (SDN), it should monitor the network traffic flow in each site and channel timely, and the data transmission path between two sites in SDN should consider the congestion in current networks. Hence, the difference of available data transmission theory between normal computer network and software definition network is that we should consider the prohibit graph structures in SDN, and these forbidden subgraphs represent the sites and channels in which data can’t be passed by the serious congestion. Inspired by theoretical analysis of an available data transmission in SDN, we consider some computational problems from the perspective of the graph theory. Several results determined in the paper imply the sufficient conditions of data transmission in SDN in the various graph settings.

1 Introduction

We equate the fractional factor problem with a relaxation of the famous cardinality matching problem which is one of the core problems in operation research. It has widely applications in various fields such as network design, combinatorial polyhedron and scheduling. For example, several large data packets are sent to different destinations through some channels in a data transmission network. This work helps to partition the large data packets into small ones and then make it efficiency improved. The available allocations of data packets is equated with the problem of fractional flow, which converts to fractional factor problem in a graph generated by a network.

Specifically, there is a graph that can model the complete network and the graph needs to meet the requirements that each site corresponds to a vertex and each channel corresponds to an edge in it. In normal network, the path of data transmission is selected by the shortest path between vertices. Several contributions on data transmission in networks are presented recently. Rolim et al. [1] studied urban sensing problem by means of opportunistic networks to support the data transmission. Vahidi et al. [2] provided the high-mobility airborne hyperspectral data transmission algorithm in view of unmanned aerial vehicles approach. Miridakis et al. [3] determined a rather cost-effective solution for the dual-hop cognitive secondary relaying system. Lee et al. [4] considered streaming data transmission on a discrete memoryless channel. However, in the setting of software definition network, the data transmission depends on the network flow computation. The transmission path is selected with minimum transmission congestion in the current moment. From this perspective, the model of data transmission problem in SDN is becoming what makes the fractional factor avoid certain subgraphs.

It is only the simple graphs that are chosen in our article. Let G = (V(G), E(G)) be a graph, in which V(G) and E(G) are the vertex set and the edge set, respectively. Let n = |V(G)| be the order of graph G. The standard notations and terminologies used but undefined clearly in this article can be found in Bondy and Mutry [5], Basavanagoud et al. [6], Wang [7], and Gao and Wang [8]. The toughness t(G) of a graph G can be stated in the below:

t(G)=min{|S|ω(GS)|SV(G),ω(GS)2},

if G is not complete; otherwise, t(G) = +∞. It is an important parameter, which is used to measure the vulnerability of networks.

Let g and f be two positive integer-valued functions on V(G) such that 0 ≤ g(x) ≤ f(x) for any xV(G). A fractional (g, f)-factor is a function h which assigns a number in [0,1] to each edge so that g(x)dGh(x)f(x) for each xV(G), where dGh(x)=eE(x)h(e) is called the fractionaldegree of x in G. A fractional (a, b)-factor (here a and b are both positive integers and ab) is a function h that assigned a number [0,1] to each edge of a graph G so that for each vertex x we have adGh(x)b. Clearly, fractional (a, b)-factor is a particular case of fractional (g, f)-factor when g(x) = a and f(x) = b for any xV(G). If a = b = k(k ≥ 1 is an integer) for all xV(G), then a fractional (a, b)-factor is just a fractional k-factor.

It’s stated that G includes a Hamiltonian fractional (g, f)-factor if G has a fractional (g, f)-factor containing a Hamiltonian cycle. A graph G is said to be an ID- Hamiltonian graph if the remaining graph of G admits a Hamiltonian cycle, when we delete any independent set of G. We say that G has an ID-Hamiltonian fractional (g, f)-factor if the remaining graph of G includes a Hamiltonian fractional (g, f)-factor when we delete any independent set of G.

In SDN, the independent set I is corresponding to the website with high transmission congestion and a Hamiltonian cycle corresponding to several channels with high transmission congestion. Thus, we study the data transmission problem by considering the Hamiltonian fractional (g, f)-factor and ID-Hamiltonian fractional (g, f)- factor in the networks model. Several related results can refer to [9-14].

The sufficient conditions of Hamiltonian fractional (g, f)-factors and ID-Hamiltonian fractional (g, f)-factors in graphs are studied and at last we obtain three results that are stated in the below.

Theorem 1

Let a, b be two integers with 3 ≤ ab, and G be a Hamiltonian graph of order n>(a+b5)(a+b3)a2.g,f are taken to be two integer-valued functions that are defined on V(G) such that ag(x) ≤ f(x) ≤ b for each xV(G). If

δ(G)(b1)n+a+b3a+b3

and

δ(G)>(b2)n+2α(G)1a+b4,

then G has a Hamiltonian fractional (g, f)-factor.

Theorem 2

Let a, b be two integers with 3 ≤ ab, and G be a Hamiltonian graph of order nb + 2. g, f are taken to be two integer-valued functions that are defined on V(G) such that ag(x) ≤ f(x) ≤ b for each xV(G). If t(G) ≥ b1+b1a2, then G has a Hamiltonian fractional (g, f )-factor.

Theorem 3

a, b are taken to be two integers with 3 ≤ ab, and G be an ID-Hamiltonian graph. And g, f are taken to be two integer-valued functions that are defined on V(G) such that ag(x) ≤ f(x) ≤ b for each xV(G). If

κ(G)max(b+1)2+4(a2)2,(a+b+1)(a+b3)4(a2)+(a+b+1)(a+b3)(b+1)2(1)

and

κ(G)(b+1)2+4(a2)4(a2)α(G),

then G has an ID-Hamiltonian fractional (g, f)-factor.

The ways to prove our major results are on the basis of the listed lemmas below:

Lemma 1

(Liu and Zhang [15]) Since G is a graph and we have H = G[T], so δ(H) ≥ 1 and 1 ≤ dG(x) ≤ k − 1 for every xV(H) where TV(G) and k ≥ 2. Let T1,..., Tk-1 be a partition of the vertices of H satisfying dG(x) = j for each xTj where some Tj are allowed to be empty on purpose. If each component of H has a vertex of degree at most k − 2 in G, then H has a maximal independent set I and a covering set C = V(H) − I such that

j=1k1(kj)cjj=1k1(k2)(kj)ij,

where cj = |CTj | and ij = |ITj| for every j = 1,..., k − 1.

Lemma 2

(Liu and Zhang [15]) Since G is a graph and H = G[T], so dG(x) = k − 1 for every xV(H) and no component of H is isomorphic to Kk where TV(G) and k ≥ 2. Then a maximal independent set I is obtained and the covering set C = V(H) − I of H satisfy

|V(H)|(k1k+1)|I|,

and

|C|(k11k+1)|I|.

Lemma 3

(Anstee [16]) Assume f and g be two integervalued functions that are defined on the vertex set of a graph G such that 0 ≤ g(x) ≤ f(x) for each xV(G). Then G has a fractional (g, f)-factor if and only if for every subset S of V(G), g(T) − dG-S(T) ≤ f(S),where T = {xV(G)\S | dG-S(x) ≤ g(x) − 1}.

Clearly, Lemma 3 is equal to the following version.

Lemma 4

Suppose that f and g are two integer-valued functions that are defined on the vertex set of a graph G such that 0 ≤ g(x) ≤ f(x) for each xV(G). Then G has a fractional (g, f )-factor if and only if

f(S)+dGS(T)g(T)0

for all disjoint subsets S, T of V(G).

Lemma 5

(Katerinis [17]) If the graph G isn’t complete, then t(G)δ(G)2.

The tricks used to prove our main results are borrowed from Zhou et al. [18], [19] and [20], and more new technologies are introduced here to deal with complex problems.

2 Proof of Theorem 1

In terms of the condition of Theorem 1 and the definition of Hamiltonian graph, G admits a Hamiltonian cycle C. Let G′ = GE(C). Clearly, G includes the desired fractional factor if H contains a fractional (g − 2, f − 2)-factor. In view of contradiction, we assume that G′ has no fractional (g − 2, f − 2)-factor. Hence, concerning Lemma 4, there are some disjoint subset S and T of V(H) satisfying

(a2)|S|+dGS(T)(b2)|T|(f2)(S)+dGS(T)(g2)(T)1.(2)

We select suitable subsets S and T with the smallest |T|.

If T = ∅, then using (2) we obtain −1 ≥ (a − 2)|S| ≥ 0, a contradiction. Thus, T ≠ ∅. Define h = min{dR-S(x) : xT}. We infer,

δ(G)dG(x1)dGS(x1)+|S|=h+|S|.(3)

Now, the following facts are to be concerned.

Claim 1.1

dG′-S(x) ≤ b − 3 for any xT.

Proof

If dG′-S(x) ≥ b − 2 for certain xT, then the subset S and T − {x} satisfy (2) as well. This is contradictive with the selection of T. □

Claim 1.2

dG-S(x) ≤ dG′-S(x) + 2 ≤ b − 1 for all xT.

Proof

From Claim 1.1 and G′ = GE(C), we deduce

dGS(x)dGS(x)+2b1

for any xT. □

Taking the definition of h and Claim 1.2 into consideration, we yield 0 ≤ hb − 1. The following proof is composed of two cases in terms of the value of h.

Case 1

h = 0.

Set X = {xT : dG-S(x) = 0}, Y = {xT : dG-S(x) = 1}, Y1 = {xY : NG-S(x) ⊆ T} and Y2 = YY1· G[Y1] has maximum degree at most 1 in GS. Let Z be a maximum independent set of G[Y1]. We get |Z|12|Y1|. On the basis of definitions, XZY2 is an independent set of G. Therefore, we get

α(G)|X|+|Z|+|Y2||X|+12|Y1|+12|Y2|=|X|+12|Y|.(4)

In terms of (2), (3), (4) and Claim 1.2, we infer

α(G)1|X|+12|Y|+(a2)|S|+dGS(T)(b2)|T||X|+12|Y|+(a2)|S|+dGS(T)2|T|(b2)|T|=|X|+12|Y|+(a2)|S|+dGS(T)b|T|=|X|+12|Y|+(a2)|S|+dGS(TXY)+|Y|b|T|=|X|+32|Y|+(a2)|S|+dGS(TXY)b|T||X|+32|Y|+(a2)|S|+2|TXY|b|T|=(a2)|S|(b2)|T|(|X|+12|Y|)(a2)δ(G)(b2)|T|α(G),
i.e.
(b2)|T|(a2)δ(G)2α(G)+1.(5)

For b ≥ 3, (3), (5) and |S| + |T| ≤ n, we get

0n|S||T|nδ(G)(a2)δ(G)2α(G)+1b2=(b2)n(a+b4)δ(G)+2α(G)1b2,

that is

δ(G)(b2)n+2α(G)1a+b4.

This contradicts δ(G)>(b2)n+2α(G)1a+b4.

Case 2

1 ≤ hb − 1.

In light of (2) and |S| + |T| ≤ n, we derive

1(a2)|S|+dGS(T)(b2)|T|(a2)|S|+dGS(T)2|T|(b2)|T|=(a2)|S|+dGS(T)b|T|(a2)|S|+h|T|b|T|=(a2)|S|(bh)|T|(a2)|S|(bh)(n|S|)=(a+bh2)|S|(bh)n,

which implies

|S|(bh)n1a+bh2.(6)

Using (3) and (6), we deduce

δ(G)|S|+h(bh)n1a+bh2+h.(7)

Subcase 2.1

h = 1.

By means of (7), we yield

δ(G)(b1)n1a+b3+1=(b1)n+a+b4a+b3,

which contradicts δ(G)(b1)n+a+b3a+b3.

Subcase 2.2

2 ≤ h = b − 1.

Set f(h)=(bh)n1a+bh2+h. From 2 ≤ hb − 1 and n > (a+b5)(a+b3)a2, we get

f(h)=n(a+bh2)+(bh)n1(a+bh2)2+1=n(a2)1(a+bh2)2+1n(a2)1(a+b4)2+1<(a+b5)(a+b3)1(a+b4)2+1=0.

Hence, max{f(h)} = f(2). According to (7) and n > (a+b5)(a+b3)a2, we have

δ(G)f(h)f(2)=(b2)n1a+b4+2<(b1)n+a+b3a+b3,

which contradicts δ(G)(b1)n+a+b3a+b3.

From what we discussed above, we can draw the conclusion that G′ has a fractional (g − 2, f − 2)-factor. Hence, the proof of Theorem 1 is finished successfully. □

3 Proof of Theorem 2

If G is complete, clearly G has a Hamiltonian fractional (g, f)-factor by the order of graph. We always assume G is not a complete graph below.

Considering the situation of Theorem 2 and the definition of Hamiltonian graph, G admits a Hamiltonian cycle C. Let G′ = GE(C). Clearly, G includes the desired fractional factor if H includes a fractional (g − 2, f − 2)-factor. Using contradiction, we assume that G′ doesn’t have fractional (g − 2, f − 2)-factor.

Then under the help of Lemma 3, there exists some subset S of V(G′) satisfying

(a2)|S|+dGS(T)(b2)|T|(f2)(S)+dGS(T)(g2)(T)1,(8)

where T = {xV(G′) − S, dG′-S(x) ≤ b − 3}. Moreover, for each xT, we get

dGS(x)dGS(x)+2b1.(9)

In light of (8) and (9), we infer

b|T|dGS(T)>(a2)|S|.(10)

Since G is not complete, by Lemma 5 we ensure δ(G) ≥ 2t(G)2(b1)+2(b1)a2>b. Hence, from (10), we get S ≠ ∅ and |S| ≠ 1. Let λ be the amount of the components of H′ = G[T] which are isomorphic to Kb and let T0 = {x : xV(H′), dG-S(x) = 0}. Let H be the subgraph gotten from H′ − T0 by deleting these λ components isomorphic to Kb.

If |V(H)| = 0, in view of (10), we obtain

b|T0|+bλ>(a2)|S|,

and

2|S|<b|T0|+bλa2.

Hence, we infer

|T0|+λ>2(a2)b.

If ω(GS) ≥ |T0| + λ > 1, we deduce

t(G)|S|ω(GS)|S||T0|+λ<b|T0|+bλ(a2)(|T0|+λ)=ba2b1+b1a2,

which contradicts to t(G)b1+b1a2.

If |T0| + λ = 1, then dG-S(x) + |S| ≥ dG(x) ≥ δ(G) ≥ 2t(G) ≥ 2(b2)+2(b1)a2. We have dGS(x)2(b2)+2(b1)a2|S|>2(b2)+2(b1)a2ba2=2(b2)+b2a2, which contradicts to (9).

Now, we discuss |V(H)| ≥ 1. Let H = H1H2, where H1 is the combination of components of H that meets dG-S(x) = b − 1 for each vertex xV(H1) and H2 = HH1. By means of Lemma 2, there exists a maximum independent set I1 and the covering set C1 = V(H1) − I1 of H1 such that

|V(H1)|(b1b+1)|I1|(11)

and

|C1|(b11b+1)|I1|.(12)

Clearly, δ(H2) ≥ 1 and Δ(H2) ≤ b − 1. Let Tj = {xV(H2)|dG-S(x) = j} for 1 ≤ jb − 1. Each component of H2 has a vertex of degree at most b − 2 in GS from the definitions of H and H2. On the ground of Lemma 1, H2 has a maximal independent set I2 and the covering set C2 = V(H2) − I2 such that

j=1b1(bj)cjj=1b1(b2)(bj)ij,(13)

where Cj = |C2Tj| and ij = |I2Tj| for each j = 1,..., b−1. Set W = V(G) − ST and U = SC1 ∪ (NG(I1) ∩ W) ∪ C2 ∪ (NG(I2) ∩ W). We infer

|U||S|+|C1|+j=1b1jij(14)

and

ω(GU)|T0|+λ+|I1|+j=1b1ij.(15)

If ω(GU) > 1, we yield

|U|t(G)ω(GU).(16)

If ω(GU) = 1, then (16) also holds.

Using (14), (15) and (16), we obtain

|S|+|C1|+j=1b1jijt(G)|T0|+λ+|I1|+i=1b1ij.(17)

In terms of (10), we yield

b|T0|+bλ+|V(H1)|+j=1b1(bj)ij+j=1b1(bj)cj>(a2)|S|.(18)

In light of (17) and (18), we have

|V(H1)|+j=1b1(bj)cj+(a2)|C1|>j=1b1((a2)t(G)(a2)jb+j)ij+((a2)t(G)b)(|T0|+λ)+(a2)t(G)|I1|.(19)

In view of t(G)b1+b1a2, we infer (a − 2)t(G) − b ≥ (a − 2)(b − 1) − 1 ≥ 1. Using (19), we deduce

|V(H1)|+j=1b1(bj)cj+(a2)|C1|>j=1b1((a2)t(G)(a2)jb+j)ij+(a2)t(G)|I1|+1.(20)

According to (11) and (12), we derive

|V(H1)|+(a2)|C1|[(b1b+1)+(a2)(b11b+1)]|I1|.

Combining this with (13) and (20), we have

j=1b1(b2)(bj)ij+[(b1b+1)+(a2)(b11b+1)]|I1|>j=1b1((a2)t(G)(a2)jb+j)ij+(a2)t(G)|I1|+1.

Therefore, at least one of the two cases below must be proved to be efficient.

Case 1

(b1b+1)+(a2)(b11b+1)>(a2)t(G)+1. We get

t(G)<b11b+1+b1b+1a21a2=b1+b21(b+1)(a2)+ba+2(b+1)(a2)1a2<b1+b21(b+1)(a2)=b1+b1a2,

which contradicts t(G)b1+b1a2.

Case 2

There exists at least one j such that

(b2)(bj)>(a2)t(G)(a2)jb+j.

It means

(b1)(bj)+(a2)j>(a2)t(G).(21)

By jb − 1 and (21), we yield

b1+(a2)(b1)>(a2)t(G).

It reveals

t(G)<b1+b1a2.

which is conflictive with t(G)b1+b1a2. □

4 Proof of Theorem 3

By means of the hypothesis of Theorem 3, GX admits a Hamiltonian cycle C for any independent set X in G. Set R = GX for any independent set XV(G). Using the hypothesis of Theorem 3 and the definition of ID- Hamiltonian graph, R contains a Hamiltonian cycle C. Set H = RE(C). Hence, G admits the desired fractional factor if H has a fractional (g − 2, f − 2)-factor. We assume that H has no fractional (g − 2, f − 2)-factor. Then, there exists some subset S of V(H) = V(R) with

(a2)|S|+dHS(T)(b2)|T|(f2)(S)+dHS(T)(g2)(T)1,(22)

where T = {xV(H) − S, dH-S(x) ≤ b − 3}.

If T = ∅, then follow from (22) we obtain

1(a2)|S|0,

which is a contradiction. Thus, T ≠ ∅.

We select x1T, so x1 is the vertex with the least degree in R[T]. Set N1 = NR[x1] ∩ T and T1 = T. For i ≥ 2, we continue set Ti = T − ∪1≤j<iNj if T − ∪1≤j<iNj ≠ ∅. In the following, we select xiTi such that xi is the vertex with the least degree in R[Ti], and set Ni = NR[xi] ∩ Ti. We continue this procedures until Ti = ∅ for some i, say for i = m + 1. In light of the concept mentioned above, we ensure that {x1, x2,...., xm} is an independent set of R. Obviously, T ≠ ∅ and m ≥ 1.

Let |Ni| = ni, and thus |T|=1imni. Set U = V(R) − (ST) and κ(RS) = t.

Claim 3.1

dR-S(x) ≤ dH-S(x) + 2 ≤ b − 1 for any xT.

Proof

Using the definition of T and H = RE(C), we infer

dRS(x)dHS(x)+2(b3)+2=b1

for any xT. □

Claim 3.2

α(G)κ(G)(a+b+1)(a+b3)4(a2).

Proof

If α(G)<(a+b+1)(a+b3)(b+1)2, then by means of (1), we deduce

κ(G)(a+b+1)(a+b3)4(a2)+(a+b+1)(a+b3)(b+1)2>(a+b+1)(a+b3)4(a2)+α(G).

If α(G)(a+b+1)(a+b3)(b+1)2, then in view of κ(G) ≥ (b+1)2+4(a2)4(a2)α(G), we get

κ(G)(b+1)2+4(a2)4(a2)α(G)=(b+1)24(a2)α(G)+α(G)(b+1)24(a2)(a+b+1)(a+b3)(b+1)2+α(G)=(a+b+1)(a+b3)4(a2)+α(G).

Now, Claim 3.2 is completed. □

Claim 3.3

U ≠ ∅ or m ≠ 1.

Proof

Assume that m = 1 and U = ∅. In terms of (22), Claim 3.1 and the selection rule of x1, we yield

1(a2)|S|+dHS(T)(b2)|T|(a2)|S|+dRS(T)2|T|(b2)|T|=(a2)|S|+dRS(T)b|T|=(a2)|S|+n1(n11)bn1,

which means

|S|n12+(b+1)n11a2.(23)

In view of (23), Claim 3.2, R = GX and |X| ≤ α(G), we have

|V(G)|=|V(R)|+|X|=|S|+|T|+|X|=|S|+n1+|X|n12+(b+1)n11a2+n1+α=n12+(a+b1)n11a2+α(a+b1)244(a2)+α=(a+b1)(a+b3)4(a2)+ακ(G),

which contradicts to |V(G)| > κ(G). Claim 3.3 is hold. □

Claim 3.4

dRS(T)1imni(ni1)+mt2.

Proof

The selection rule of xi reveals that all vertices in Ni have degree at least ni − 1 in R[Ti]. Therefore, we obtain

1im(xNidR[Ti](x))1imni(ni1).(24)

On the left of (24), an edge joining xNi and yNj (i < j) is counted only once, i.e., it is counted in the term dR[Ti](x) but not in dR[Tj](y). Therefore, we derive

dRS(T)1imni(ni1)+1i<jmeR(Ni,Nj)+eR(T,U).(25)

In light of κ(RS) = t and Claim 3.3, we yield

eR(Ni,jiNj)+eR(Ni,U)t(26)

for any Ni(i = 1, 2,..., m). By means of (26), we get

1im(eR(Ni,jiNj)+eR(Ni,U))=2(1i<jmeR(Ni,Nj)+eR(T,U))mt,

which implies

1i<jmeR(Ni,Nj)+eR(T,U)mt2.(27)

Using (25) and (27), we infer

dRS(T)1imni(ni1)+mt2.

Therefore, Claim 3.4 is proved. □

In terms of |T|=1imni, (22), Claim 3.1 and Claim 3.4, we have

1(a2)|S|+dHS(T)(b2)|T|(a2)|S|+dRS(T)2|T|(b2)|T|=(a2)|S|+dRS(T)b|T|(a2)|S|+1imni(ni1)+mt2b1imni=(a2)|S|+1im(ni2(b+1)ni)+mt2,
i.e.,
1(a2)|S|+1im(ni2(b+1)ni)+mt2.(28)

Let f(ni)=ni2(b+1)ni. It is easy to say that min{f(ni)}=(b+1)24. Hence, we infer

ni2(b+1)ni(b+1)24.(29)

According to (28) and (29), we deduce

1(a2)|S|+1im((b+1)24)+mt2=(a2)|S|(b+1)2m4+mt2.(30)

Claim 3.5

(b+1)24+t2<0.

Proof

Suppose that (b+1)24+t20. In view of (30), m ≥ 1 and |S|≥ 0, we get

1(a2)|S|(b+1)2m4+mt20,

a contradiction. Then proof of Claim 3.5 is completed. □

Note that {x1, x2,..., xm} is an independent set of R. We obtain

α(R[T])m.(31)

In view of R = GX and (32), we yield

α(G)α(R)α(R[T])m.(32)

Note that R = GX and κ(RS) = t. It is obvious that

κ(G)κ(GX)+|X|=κ(R)+|X|κ(RS)+|S|+|X|=t+|S|+|X|.(33)

In light of (30), (32), (33), |X| ≤ α(G), Claim 3.5, κ(G) ≥ (b+1)2+4(a2)2,andκ(G)(b+1)2+4(a2)4(a2)α(G), we have

1(a2)|S|(b+1)2m4+mt2=(a2)|S|+((b+1)24+t2)m(a2)(κ(G)|X|t)+((b+1)24+t2)α(G)(a2)(κ(G)α(G)t)+((b+1)24+t2)α(G)(a2)(κ(G)4(a2)κ(G)(b+1)2+4(a2)t)+((b+1)24+t2)4(a2)κ(G)(b+1)2+4(a2)=(a2)t(2κ(G)(b+1)2+4(a2)1)0,

a contradiction. Therefore, we finish proving Theorem 3. □

  1. Conflict of interest

    Conflict of Interests: It is declared that there is no conflict of interests regarding the publication of this paper.

Acknowledgement

The constructive comments from the reviewers to improve the paper are sincerely appreciated.

References

[1] Rolim C.O., Rossetto A.G., Leithardt V.R.Q., Borges G.A., Geyer C.F.R., dos Santos T.F.M., Souza A.M., Situation awareness and computational intelligence in opportunistic networks to support the datatransmission of urban sensing applications, Comput. Netw., 2016, 111, 55-70.10.1016/j.comnet.2016.07.014Search in Google Scholar

[2] Vahidi V., Yazdanpanah A.P., Saberinia E., Regentova E.E., Channel estimation, equalisation, and evaluation for high-mobility airborne hyperspectral datatransmission, IET Commun., 2016, 18, 2656-2662.10.1049/iet-com.2016.0599Search in Google Scholar

[3] Miridakis N.I., Tsiftsis T.A ., Alexandropoulos G.C., Debbah M., Green cognitive relaying: opportunistically switching between data transmission and energy harvesting, IEEE J. Sel. Area. Comm., 2016, 34, 3725-3738.10.1109/JSAC.2016.2611841Search in Google Scholar

[4] Lee S.H., Tan V.Y.F., Khisti A., Streaming data transmission in the moderate deviations and central limit regimes, IEEE T. Inform. Theory, 2016, 62, 6816-6830.10.1109/ISIT.2016.7541864Search in Google Scholar

[5] Bondy J.A., Mutry U.S.R., Graph Theory, Springer Publisher, Berlin, 2008.10.1007/978-1-84628-970-5Search in Google Scholar

[6] Basavanagoud B., Desai V.R., Patil S., (β, α)-Connectivity index of graphs, Appl. Math. Nonl. Sc., 2017, 2, 21-30.10.21042/AMNS.2017.1.00003Search in Google Scholar

[7] Wang Y.Q., An improved upper bound on the linear 2-arboricity of planar graphs, Discrete Math., 2016, 339, 39-45.10.1016/j.disc.2015.07.003Search in Google Scholar

[8] Gao W., Wang W.F., New isolated toughness condition for fractional (g, f, n)-critical graphs, Colloq. Math., 2017, 147, 55-66.10.4064/cm6713-8-2016Search in Google Scholar

[9] Gao W., Guo Y., Wang K.Y., Ontology algorithm using singular value decomposition and applied in multidisciplinary, Cluster Comput., 2016, 19, 2201-2210.10.1007/s10586-016-0651-0Search in Google Scholar

[10] Gao W., Wang W.F., The fifth geometric arithmetic index of bridge graph and carbon nanocones, J. Differ. Equ. Appl., 2017, 23, 100-109.10.1080/10236198.2016.1197214Search in Google Scholar

[11] Gao W., Wang W.F., The eccentric connectivity polynomial of two classes of nanotubes, Chaos, Solitons Fract. 2016, 89, 290-294.10.1016/j.chaos.2015.11.035Search in Google Scholar

[12] Gao W., Guirao J.L.G., Wu H.L., Two tight independent set conditions for fractional (g, f, m)-deleted graphs systems, Qual. Theory Dyn. Syst., 2017, 10.1007/s12346-016-0222-z.Search in Google Scholar

[13] Guirao J.L.G., Luo A.C.J., New trends in nonlinear dynamics and chaoticity, Nonlinear Dynam., 2016, 84, 1-2.10.1007/s11071-016-2656-xSearch in Google Scholar

[14] Maldonado M., Prada J., Senosiain M.J., On linear operators and bases on Köthe spaces, Appl. Math. Nonl. Sc., 2016, 1, 617-624.10.21042/AMNS.2016.2.00047Search in Google Scholar

[15] Liu G.Z., Zhang L.J., Toughness and the existence of fractional κ-factors of graphs, Discrete Math., 2008, 308, 1741-1748.10.1016/j.disc.2006.09.048Search in Google Scholar

[16] Anstee R.P., Simplified existence theorems for (g, f)-factors, Discrete Appl. Math., 1990, 27, 29-38.10.1016/0166-218X(90)90126-WSearch in Google Scholar

[17] Katerinis P., Toughness of graphs and the existence of factors, Discrete Math., 1990, 80, 81-92.10.1016/0012-365X(90)90297-USearch in Google Scholar

[18] Zhou S.Z., Pu B.Y., Minimum degree and independence number for the existence of Hamiltonian [a, b]-factors, J. Appl. Math. & Informatics, 2010, 28, 325-331.Search in Google Scholar

[19] Zhou S.Z., Toughness and the existence of Hamiltonian [a, b]-factors of graphs, Utilitas Math., 2013, 90, 187-197.Search in Google Scholar

[20] Zhou S.Z., Zhang T., Xu L., A sufficient condition for graphs to have ID-Hamiltonian [a, b]-factors, Utilitas Math., In press.Search in Google Scholar

Received: 2017-1-26
Accepted: 2017-3-13
Published Online: 2017-8-3

© 2017 W. Gao et al.

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 3.0 License.

Articles in the same Issue

  1. Regular Articles
  2. Analysis of a New Fractional Model for Damped Bergers’ Equation
  3. Regular Articles
  4. Optimal homotopy perturbation method for nonlinear differential equations governing MHD Jeffery-Hamel flow with heat transfer problem
  5. Regular Articles
  6. Semi- analytic numerical method for solution of time-space fractional heat and wave type equations with variable coefficients
  7. Regular Articles
  8. Investigation of a curve using Frenet frame in the lightlike cone
  9. Regular Articles
  10. Construction of complex networks from time series based on the cross correlation interval
  11. Regular Articles
  12. Nonlinear Schrödinger approach to European option pricing
  13. Regular Articles
  14. A modified cubic B-spline differential quadrature method for three-dimensional non-linear diffusion equations
  15. Regular Articles
  16. A new miniaturized negative-index meta-atom for tri-band applications
  17. Regular Articles
  18. Seismic stability of the survey areas of potential sites for the deep geological repository of the spent nuclear fuel
  19. Regular Articles
  20. Distributed containment control of heterogeneous fractional-order multi-agent systems with communication delays
  21. Regular Articles
  22. Sensitivity analysis and economic optimization studies of inverted five-spot gas cycling in gas condensate reservoir
  23. Regular Articles
  24. Quantum mechanics with geometric constraints of Friedmann type
  25. Regular Articles
  26. Modeling and Simulation for an 8 kW Three-Phase Grid-Connected Photo-Voltaic Power System
  27. Regular Articles
  28. Application of the optimal homotopy asymptotic method to nonlinear Bingham fluid dampers
  29. Regular Articles
  30. Analysis of Drude model using fractional derivatives without singular kernels
  31. Regular Articles
  32. An unsteady MHD Maxwell nanofluid flow with convective boundary conditions using spectral local linearization method
  33. Regular Articles
  34. New analytical solutions for conformable fractional PDEs arising in mathematical physics by exp-function method
  35. Regular Articles
  36. Quantum mechanical calculation of electron spin
  37. Regular Articles
  38. CO2 capture by polymeric membranes composed of hyper-branched polymers with dense poly(oxyethylene) comb and poly(amidoamine)
  39. Regular Articles
  40. Chain on a cone
  41. Regular Articles
  42. Multi-task feature learning by using trace norm regularization
  43. Regular Articles
  44. Superluminal tunneling of a relativistic half-integer spin particle through a potential barrier
  45. Regular Articles
  46. Neutrosophic triplet normed space
  47. Regular Articles
  48. Lie algebraic discussion for affinity based information diffusion in social networks
  49. Regular Articles
  50. Radiation dose and cancer risk estimates in helical CT for pulmonary tuberculosis infections
  51. Regular Articles
  52. A comparison study of steady-state vibrations with single fractional-order and distributed-order derivatives
  53. Regular Articles
  54. Some new remarks on MHD Jeffery-Hamel fluid flow problem
  55. Regular Articles
  56. Numerical investigation of magnetohydrodynamic slip flow of power-law nanofluid with temperature dependent viscosity and thermal conductivity over a permeable surface
  57. Regular Articles
  58. Charge conservation in a gravitational field in the scalar ether theory
  59. Regular Articles
  60. Measurement problem and local hidden variables with entangled photons
  61. Regular Articles
  62. Compression of hyper-spectral images using an accelerated nonnegative tensor decomposition
  63. Regular Articles
  64. Fabrication and application of coaxial polyvinyl alcohol/chitosan nanofiber membranes
  65. Regular Articles
  66. Calculating degree-based topological indices of dominating David derived networks
  67. Regular Articles
  68. The structure and conductivity of polyelectrolyte based on MEH-PPV and potassium iodide (KI) for dye-sensitized solar cells
  69. Regular Articles
  70. Chiral symmetry restoration and the critical end point in QCD
  71. Regular Articles
  72. Numerical solution for fractional Bratu’s initial value problem
  73. Regular Articles
  74. Structure and optical properties of TiO2 thin films deposited by ALD method
  75. Regular Articles
  76. Quadruple multi-wavelength conversion for access network scalability based on cross-phase modulation in an SOA-MZI
  77. Regular Articles
  78. Application of ANNs approach for wave-like and heat-like equations
  79. Special issue on Nonlinear Dynamics in General and Dynamical Systems in particular
  80. Study on node importance evaluation of the high-speed passenger traffic complex network based on the Structural Hole Theory
  81. Special issue on Nonlinear Dynamics in General and Dynamical Systems in particular
  82. A mathematical/physics model to measure the role of information and communication technology in some economies: the Chinese case
  83. Special issue on Nonlinear Dynamics in General and Dynamical Systems in particular
  84. Numerical modeling of the thermoelectric cooler with a complementary equation for heat circulation in air gaps
  85. Special issue on Nonlinear Dynamics in General and Dynamical Systems in particular
  86. On the libration collinear points in the restricted three – body problem
  87. Special issue on Nonlinear Dynamics in General and Dynamical Systems in particular
  88. Research on Critical Nodes Algorithm in Social Complex Networks
  89. Special issue on Nonlinear Dynamics in General and Dynamical Systems in particular
  90. A simulation based research on chance constrained programming in robust facility location problem
  91. Special issue on Nonlinear Dynamics in General and Dynamical Systems in particular
  92. A mathematical/physics carbon emission reduction strategy for building supply chain network based on carbon tax policy
  93. Special issue on Nonlinear Dynamics in General and Dynamical Systems in particular
  94. Mathematical analysis of the impact mechanism of information platform on agro-product supply chain and agro-product competitiveness
  95. Special issue on Nonlinear Dynamics in General and Dynamical Systems in particular
  96. A real negative selection algorithm with evolutionary preference for anomaly detection
  97. Special issue on Nonlinear Dynamics in General and Dynamical Systems in particular
  98. A privacy-preserving parallel and homomorphic encryption scheme
  99. Special issue on Nonlinear Dynamics in General and Dynamical Systems in particular
  100. Random walk-based similarity measure method for patterns in complex object
  101. Special issue on Nonlinear Dynamics in General and Dynamical Systems in particular
  102. A Mathematical Study of Accessibility and Cohesion Degree in a High-Speed Rail Station Connected to an Urban Bus Transport Network
  103. Special issue on Nonlinear Dynamics in General and Dynamical Systems in particular
  104. Design and Simulation of the Integrated Navigation System based on Extended Kalman Filter
  105. Special issue on Nonlinear Dynamics in General and Dynamical Systems in particular
  106. Oil exploration oriented multi-sensor image fusion algorithm
  107. Special issue on Nonlinear Dynamics in General and Dynamical Systems in particular
  108. Analysis of Product Distribution Strategy in Digital Publishing Industry Based on Game-Theory
  109. Special issue on Nonlinear Dynamics in General and Dynamical Systems in particular
  110. Expanded Study on the accumulation effect of tourism under the constraint of structure
  111. Special issue on Nonlinear Dynamics in General and Dynamical Systems in particular
  112. Unstructured P2P Network Load Balance Strategy Based on Multilevel Partitioning of Hypergraph
  113. Special issue on Nonlinear Dynamics in General and Dynamical Systems in particular
  114. Research on the method of information system risk state estimation based on clustering particle filter
  115. Special issue on Nonlinear Dynamics in General and Dynamical Systems in particular
  116. Demand forecasting and information platform in tourism
  117. Special issue on Nonlinear Dynamics in General and Dynamical Systems in particular
  118. Physical-chemical properties studying of molecular structures via topological index calculating
  119. Special issue on Nonlinear Dynamics in General and Dynamical Systems in particular
  120. Local kernel nonparametric discriminant analysis for adaptive extraction of complex structures
  121. Special issue on Nonlinear Dynamics in General and Dynamical Systems in particular
  122. City traffic flow breakdown prediction based on fuzzy rough set
  123. Special issue on Nonlinear Dynamics in General and Dynamical Systems in particular
  124. Conservation laws for a strongly damped wave equation
  125. Special issue on Nonlinear Dynamics in General and Dynamical Systems in particular
  126. Blending type approximation by Stancu-Kantorovich operators based on Pólya-Eggenberger distribution
  127. Special issue on Nonlinear Dynamics in General and Dynamical Systems in particular
  128. Computing the Ediz eccentric connectivity index of discrete dynamic structures
  129. Special issue on Nonlinear Dynamics in General and Dynamical Systems in particular
  130. A discrete epidemic model for bovine Babesiosis disease and tick populations
  131. Special issue on Nonlinear Dynamics in General and Dynamical Systems in particular
  132. Study on maintaining formations during satellite formation flying based on SDRE and LQR
  133. Special issue on Nonlinear Dynamics in General and Dynamical Systems in particular
  134. Relationship between solitary pulmonary nodule lung cancer and CT image features based on gradual clustering
  135. Special issue on Nonlinear Dynamics in General and Dynamical Systems in particular
  136. A novel fast target tracking method for UAV aerial image
  137. Special issue on Nonlinear Dynamics in General and Dynamical Systems in particular
  138. Fuzzy comprehensive evaluation model of interuniversity collaborative learning based on network
  139. Special issue on Nonlinear Dynamics in General and Dynamical Systems in particular
  140. Conservation laws, classical symmetries and exact solutions of the generalized KdV-Burgers-Kuramoto equation
  141. Special issue on Nonlinear Dynamics in General and Dynamical Systems in particular
  142. After notes on self-similarity exponent for fractal structures
  143. Special issue on Nonlinear Dynamics in General and Dynamical Systems in particular
  144. Excitation probability and effective temperature in the stationary regime of conductivity for Coulomb Glasses
  145. Special issue on Nonlinear Dynamics in General and Dynamical Systems in particular
  146. Comparisons of feature extraction algorithm based on unmanned aerial vehicle image
  147. Special issue on Nonlinear Dynamics in General and Dynamical Systems in particular
  148. Research on identification method of heavy vehicle rollover based on hidden Markov model
  149. Special issue on Nonlinear Dynamics in General and Dynamical Systems in particular
  150. Classifying BCI signals from novice users with extreme learning machine
  151. Special issue on Nonlinear Dynamics in General and Dynamical Systems in particular
  152. Topics on data transmission problem in software definition network
  153. Special issue on Nonlinear Dynamics in General and Dynamical Systems in particular
  154. Statistical inferences with jointly type-II censored samples from two Pareto distributions
  155. Special issue on Nonlinear Dynamics in General and Dynamical Systems in particular
  156. Estimation for coefficient of variation of an extension of the exponential distribution under type-II censoring scheme
  157. Special issue on Nonlinear Dynamics in General and Dynamical Systems in particular
  158. Analysis on trust influencing factors and trust model from multiple perspectives of online Auction
  159. Special Issue on Advances on Modelling of Flowing and Transport in Porous Media
  160. Coupling of two-phase flow in fractured-vuggy reservoir with filling medium
  161. Special Issue on Advances on Modelling of Flowing and Transport in Porous Media
  162. Production decline type curves analysis of a finite conductivity fractured well in coalbed methane reservoirs
  163. Special Issue on Advances on Modelling of Flowing and Transport in Porous Media
  164. Flow Characteristic and Heat Transfer for Non-Newtonian Nanofluid in Rectangular Microchannels with Teardrop Dimples/Protrusions
  165. Special Issue on Advances on Modelling of Flowing and Transport in Porous Media
  166. The size prediction of potential inclusions embedded in the sub-surface of fused silica by damage morphology
  167. Special Issue on Advances on Modelling of Flowing and Transport in Porous Media
  168. Research on carbonate reservoir interwell connectivity based on a modified diffusivity filter model
  169. Special Issue on Advances on Modelling of Flowing and Transport in Porous Media
  170. The method of the spatial locating of macroscopic throats based-on the inversion of dynamic interwell connectivity
  171. Special Issue on Advances on Modelling of Flowing and Transport in Porous Media
  172. Unsteady mixed convection flow through a permeable stretching flat surface with partial slip effects through MHD nanofluid using spectral relaxation method
  173. Special Issue on Advances on Modelling of Flowing and Transport in Porous Media
  174. A volumetric ablation model of EPDM considering complex physicochemical process in porous structure of char layer
  175. Special Issue on Advances on Modelling of Flowing and Transport in Porous Media
  176. Numerical simulation on ferrofluid flow in fractured porous media based on discrete-fracture model
  177. Special Issue on Advances on Modelling of Flowing and Transport in Porous Media
  178. Macroscopic lattice Boltzmann model for heat and moisture transfer process with phase transformation in unsaturated porous media during freezing process
  179. Special Issue on Advances on Modelling of Flowing and Transport in Porous Media
  180. Modelling of intermittent microwave convective drying: parameter sensitivity
  181. Special Issue on Advances on Modelling of Flowing and Transport in Porous Media
  182. Simulating gas-water relative permeabilities for nanoscale porous media with interfacial effects
  183. Special Issue on Advances on Modelling of Flowing and Transport in Porous Media
  184. Simulation of counter-current imbibition in water-wet fractured reservoirs based on discrete-fracture model
  185. Special Issue on Advances on Modelling of Flowing and Transport in Porous Media
  186. Investigation effect of wettability and heterogeneity in water flooding and on microscopic residual oil distribution in tight sandstone cores with NMR technique
  187. Special Issue on Advances on Modelling of Flowing and Transport in Porous Media
  188. Analytical modeling of coupled flow and geomechanics for vertical fractured well in tight gas reservoirs
  189. Special Issue on Ever-New "Loopholes" in Bell’s Argument and Experimental Tests
  190. Special Issue: Ever New "Loopholes" in Bell’s Argument and Experimental Tests
  191. Special Issue on Ever-New "Loopholes" in Bell’s Argument and Experimental Tests
  192. The ultimate loophole in Bell’s theorem: The inequality is identically satisfied by data sets composed of ±1′s assuming merely that they exist
  193. Special Issue on Ever-New "Loopholes" in Bell’s Argument and Experimental Tests
  194. Erratum to: The ultimate loophole in Bell’s theorem: The inequality is identically satisfied by data sets composed of ±1′s assuming merely that they exist
  195. Special Issue on Ever-New "Loopholes" in Bell’s Argument and Experimental Tests
  196. Rhetoric, logic, and experiment in the quantum nonlocality debate
  197. Special Issue on Ever-New "Loopholes" in Bell’s Argument and Experimental Tests
  198. What If Quantum Theory Violates All Mathematics?
  199. Special Issue on Ever-New "Loopholes" in Bell’s Argument and Experimental Tests
  200. Relativity, anomalies and objectivity loophole in recent tests of local realism
  201. Special Issue on Ever-New "Loopholes" in Bell’s Argument and Experimental Tests
  202. The photon identification loophole in EPRB experiments: computer models with single-wing selection
  203. Special Issue on Ever-New "Loopholes" in Bell’s Argument and Experimental Tests
  204. Bohr against Bell: complementarity versus nonlocality
  205. Special Issue on Ever-New "Loopholes" in Bell’s Argument and Experimental Tests
  206. Is Einsteinian no-signalling violated in Bell tests?
  207. Special Issue on Ever-New "Loopholes" in Bell’s Argument and Experimental Tests
  208. Bell’s “Theorem”: loopholes vs. conceptual flaws
  209. Special Issue on Ever-New "Loopholes" in Bell’s Argument and Experimental Tests
  210. Nonrecurrence and Bell-like inequalities
  211. Special Issue: The 18th International Symposium on Electromagnetic Fields in Mechatronics, Electrical and Electronic Engineering ISEF 2017
  212. Three-dimensional computer models of electrospinning systems
  213. Special Issue: The 18th International Symposium on Electromagnetic Fields in Mechatronics, Electrical and Electronic Engineering ISEF 2017
  214. Electric field computation and measurements in the electroporation of inhomogeneous samples
  215. Special Issue: The 18th International Symposium on Electromagnetic Fields in Mechatronics, Electrical and Electronic Engineering ISEF 2017
  216. Modelling of magnetostriction of transformer magnetic core for vibration analysis
  217. Special Issue: The 18th International Symposium on Electromagnetic Fields in Mechatronics, Electrical and Electronic Engineering ISEF 2017
  218. Comparison of the fractional power motor with cores made of various magnetic materials
  219. Special Issue: The 18th International Symposium on Electromagnetic Fields in Mechatronics, Electrical and Electronic Engineering ISEF 2017
  220. Dynamics of the line-start reluctance motor with rotor made of SMC material
  221. Special Issue: The 18th International Symposium on Electromagnetic Fields in Mechatronics, Electrical and Electronic Engineering ISEF 2017
  222. Inhomogeneous dielectrics: conformal mapping and finite-element models
  223. Special Issue: The 18th International Symposium on Electromagnetic Fields in Mechatronics, Electrical and Electronic Engineering ISEF 2017
  224. Topology optimization of induction heating model using sequential linear programming based on move limit with adaptive relaxation
  225. Special Issue: The 18th International Symposium on Electromagnetic Fields in Mechatronics, Electrical and Electronic Engineering ISEF 2017
  226. Detection of inter-turn short-circuit at start-up of induction machine based on torque analysis
  227. Special Issue: The 18th International Symposium on Electromagnetic Fields in Mechatronics, Electrical and Electronic Engineering ISEF 2017
  228. Current superimposition variable flux reluctance motor with 8 salient poles
  229. Special Issue: The 18th International Symposium on Electromagnetic Fields in Mechatronics, Electrical and Electronic Engineering ISEF 2017
  230. Modelling axial vibration in windings of power transformers
  231. Special Issue: The 18th International Symposium on Electromagnetic Fields in Mechatronics, Electrical and Electronic Engineering ISEF 2017
  232. Field analysis & eddy current losses calculation in five-phase tubular actuator
  233. Special Issue: The 18th International Symposium on Electromagnetic Fields in Mechatronics, Electrical and Electronic Engineering ISEF 2017
  234. Hybrid excited claw pole generator with skewed and non-skewed permanent magnets
  235. Special Issue: The 18th International Symposium on Electromagnetic Fields in Mechatronics, Electrical and Electronic Engineering ISEF 2017
  236. Electromagnetic phenomena analysis in brushless DC motor with speed control using PWM method
  237. Special Issue: The 18th International Symposium on Electromagnetic Fields in Mechatronics, Electrical and Electronic Engineering ISEF 2017
  238. Field-circuit analysis and measurements of a single-phase self-excited induction generator
  239. Special Issue: The 18th International Symposium on Electromagnetic Fields in Mechatronics, Electrical and Electronic Engineering ISEF 2017
  240. A comparative analysis between classical and modified approach of description of the electrical machine windings by means of T0 method
  241. Special Issue: The 18th International Symposium on Electromagnetic Fields in Mechatronics, Electrical and Electronic Engineering ISEF 2017
  242. Field-based optimal-design of an electric motor: a new sensitivity formulation
  243. Special Issue: The 18th International Symposium on Electromagnetic Fields in Mechatronics, Electrical and Electronic Engineering ISEF 2017
  244. Application of the parametric proper generalized decomposition to the frequency-dependent calculation of the impedance of an AC line with rectangular conductors
  245. Special Issue: The 18th International Symposium on Electromagnetic Fields in Mechatronics, Electrical and Electronic Engineering ISEF 2017
  246. Virtual reality as a new trend in mechanical and electrical engineering education
  247. Special Issue: The 18th International Symposium on Electromagnetic Fields in Mechatronics, Electrical and Electronic Engineering ISEF 2017
  248. Holonomicity analysis of electromechanical systems
  249. Special Issue: The 18th International Symposium on Electromagnetic Fields in Mechatronics, Electrical and Electronic Engineering ISEF 2017
  250. An accurate reactive power control study in virtual flux droop control
  251. Special Issue: The 18th International Symposium on Electromagnetic Fields in Mechatronics, Electrical and Electronic Engineering ISEF 2017
  252. Localized probability of improvement for kriging based multi-objective optimization
  253. Special Issue: The 18th International Symposium on Electromagnetic Fields in Mechatronics, Electrical and Electronic Engineering ISEF 2017
  254. Research of influence of open-winding faults on properties of brushless permanent magnets motor
  255. Special Issue: The 18th International Symposium on Electromagnetic Fields in Mechatronics, Electrical and Electronic Engineering ISEF 2017
  256. Optimal design of the rotor geometry of line-start permanent magnet synchronous motor using the bat algorithm
  257. Special Issue: The 18th International Symposium on Electromagnetic Fields in Mechatronics, Electrical and Electronic Engineering ISEF 2017
  258. Model of depositing layer on cylindrical surface produced by induction-assisted laser cladding process
  259. Special Issue: The 18th International Symposium on Electromagnetic Fields in Mechatronics, Electrical and Electronic Engineering ISEF 2017
  260. Detection of inter-turn faults in transformer winding using the capacitor discharge method
  261. Special Issue: The 18th International Symposium on Electromagnetic Fields in Mechatronics, Electrical and Electronic Engineering ISEF 2017
  262. A novel hybrid genetic algorithm for optimal design of IPM machines for electric vehicle
  263. Special Issue: The 18th International Symposium on Electromagnetic Fields in Mechatronics, Electrical and Electronic Engineering ISEF 2017
  264. Lamination effects on a 3D model of the magnetic core of power transformers
  265. Special Issue: The 18th International Symposium on Electromagnetic Fields in Mechatronics, Electrical and Electronic Engineering ISEF 2017
  266. Detection of vertical disparity in three-dimensional visualizations
  267. Special Issue: The 18th International Symposium on Electromagnetic Fields in Mechatronics, Electrical and Electronic Engineering ISEF 2017
  268. Calculations of magnetic field in dynamo sheets taking into account their texture
  269. Special Issue: The 18th International Symposium on Electromagnetic Fields in Mechatronics, Electrical and Electronic Engineering ISEF 2017
  270. 3-dimensional computer model of electrospinning multicapillary unit used for electrostatic field analysis
  271. Special Issue: The 18th International Symposium on Electromagnetic Fields in Mechatronics, Electrical and Electronic Engineering ISEF 2017
  272. Optimization of wearable microwave antenna with simplified electromagnetic model of the human body
  273. Special Issue: The 18th International Symposium on Electromagnetic Fields in Mechatronics, Electrical and Electronic Engineering ISEF 2017
  274. Induction heating process of ferromagnetic filled carbon nanotubes based on 3-D model
  275. Special Issue: The 18th International Symposium on Electromagnetic Fields in Mechatronics, Electrical and Electronic Engineering ISEF 2017
  276. Speed control of an induction motor by 6-switched 3-level inverter
Downloaded on 23.9.2025 from https://www.degruyterbrill.com/document/doi/10.1515/phys-2017-0057/html?lang=en
Scroll to top button