Home Neighborhood condition for all fractional (g, f, n′, m)-critical deleted graphs
Article Open Access

Neighborhood condition for all fractional (g, f, n′, m)-critical deleted graphs

  • Wei Gao , Yunqing Zhang and Yaojun Chen EMAIL logo
Published/Copyright: August 20, 2018
Download Article (PDF)
Open Physics
From the journal Open Physics Volume 16 Issue 1

Abstract

In data transmission networks, the availability of data transmission is equivalent to the existence of the fractional factor of the corresponding graph which is generated by the network. Research on the existence of fractional factors under specific network structures can help scientists design and construct networks with high data transmission rates. A graph G is named as an all fractional (g, f, n′, m)-critical deleted graph if the remaining subgraph keeps being an all fractional (g, f, m)-critical graph, despite experiencing the removal of arbitrary n′ vertices of G. In this paper, we study the relationship between neighborhood conditions and a graph to be all fractional (g, f, n′, m)-critical deleted. Two sufficient neighborhood conditions are determined, and furthermore we show that the conditions stated in the main results are sharp.

Keywords: graph; data transmission network; all fractional factor; all fractional (g, f, n′, m)-critical deleted graph
PACS: 02.10.Ox; 07.05.Mh

1 Introduction

The classic fractional factor problem is usually regarded as an extension of illustrious cardinality matching which is one of the hot topics in graph theory and operations research. Its extensive applications can be found in many domains like combinatorial polyhedron, scheduling and designing of network. For instance, we send some large data packets to several destinations through channels of the data transmission network, and the efficiency will be improved if the large data packets can be categorized into more smaller ones. The problem of feasibility allocations of data packets can be considered as the existence of fractional flow in the network, and it can be transformed to the fractional factor problem in the network graph.

In particular, the whole network can be modelled as a graph in which each vertex represents a site and each edge denotes a channel. In normal networks, the route of data transmission is picked out based on the shortest path between vertices. A few advances of data transmission in networks have been manifested in recent years. Rolim et al. [1] improved the data transmission by studying an urban sensing problem in view of opportunistic networks. Vahidi et al. [2] considered unmanned aerial vehicles and proposed the high-mobility airborne hyperspectral data transmission algorithm. Miridakis et al. [3] adopted a cost-effective solution to study the dual-hop cognitive secondary relaying system. Streaming data transmission on a discrete memoryless channel was discussed by Lee et al. [4]. But, in the context of software definition network (SDN), the path between vertices in data transmission relies on the current network flow computation. With minimum transmission congestion in the current moment, the transmission route is chosen. In this view, the framework of data transmission problem in SDN equals to the existence of the fractional factor avoiding certain subgraphs.

Throughout this paper, we only consider the simple graph which corresponds to a data transmission network. Let G = (V(G), then E(G)) be a graph with vertex set V(G) and edge set E(G). For any x ∈ V(G), we denote dG(x) and NG(x) by the degree and the open neighborhood of x in G, separately. Set NG[x] = NG(x) ∪ {x} as the closed neighborhood of x in G. We denote by G[S] the subgraph of G induced by S, and G–S = G[V(G) ∖ S] for any S ⊆ V(G). For two vertex-disjoint subsets S, T ⊂ V(G), we set eG(S, T) = |{e = xy|x ∈ S, y ∈ T}|. We denote the minimum degree of G by δ(G) = min{dG(x) : x ∈ V(G)}. As a simple expression, we take d(x) to express dG(x) for x ∈ V(G). More terminologies and notations used but undefined in our article can be found in book Bondy and Mutry [5].

Let g and f be integer-valued functions on V(G) satisfying 0 ≤ g(x) ≤ f(x) for any x ∈ V(G). A fractional (g, f)-factor can be considered as a function h that gives to every edge of a graph G a real number in [0, 1] with g(x)≤∑e∈E(x)h(e)≤f(x) for each vertex x. If g(x) = f(x) for any x ∈ V(G), a fractional (g, f)-factor is a fractional f-factor. If g(x) = a and f(x) = b for any x ∈ V(G), then a fractional (g, f)-factor is a fractional [a, b]-factor. Furthermore, a fractional (g, f)-factor becomes a fractional k-factor if g(x) = f(x) = k (where k ≥ 1 is an integer) for any x ∈ V(G). Then, we always assume that n is the order of G, namely, n = |V(G)|.

If G has a fractional p-factor for every p : V(G) → ℕ such that g(x) ≤ p(x) ≤ f(x) for any x ∈ V(G), G possesses all fractional (g, f)-factors. If g(x) = a, f(x) = b for each x ∈ V(G) and G possesses all fractional (g, f)-factors, then G has all fractional [a, b]-factors.

Lu [6] determined the sufficient and necessary condition for a graph that has all fractional (g, f)-factors.

Theorem 1

(Lu [6]) Assume G to be a graph, g, f : V(G) → ℤ+ be integer functions so that g(x) ≤ f(x) for all x ∈ V(G), so G has all fractional (g, f)-factors. If and only if for any subset S ⊆ V(G), we have

g(S)−f(T)+∑x∈TdG−S(x)≥0,

where T = {x ∈ V(G) – S|dG–S(x) < f(x)}.

Obviously, this sufficient and necessary condition equals to the following version.

Theorem 2

Assume G be a graph, g, f : V(G)→ ℤ+ be integer functions so that g(x) ≤ f(x) for all x ∈ V(G). As a result, G has all fractional (g, f)-factors. If and only if

g(S)−f(T)+∑x∈TdG−S(x)≥0

for arbitrary non-disjoint subsets S, T ⊆ V(G).

Set g(x) = a, f(x) = b for each x ∈ V(G), we immediately get the below corollary from Theorem 1.

Corollary 1

Let G be a graph and a ≤ b be two positive integers. Then G has all fractional [a, b]-factors if and only if for any subset S ⊆ V(G), we have

a|S|−b|T|+∑x∈TdG−S(x)≥0,

where T = {x ∈ V(G) – S|dG–S(x) < b}.

Also, this sufficient and necessary condition in Corollary 1 for all fractional [a, b]-factors equals to the following version.

Corollary 2

Let G be a graph and a ≤ b be two positive integers. Then G has all fractional [a, b]-factors if and only if

a|S|−b|T|+∑x∈TdG−S(x)≥0

for arbitrary non-disjoint subsets S, T ⊆ V(G).

Zhou and Zhang [7] presented the sufficient and necessary situation for a graph with all fractional (g, f)-factors excluding a subgraph H.

Theorem 3

(Zhou and Zhang [7]) Let G be a graph and H be a subgraph of G. Let g, f : V(G) → ℤ+ be two integer-valued functions with g(x) ≤ f(x) for each x ∈ V(G). Then G admits all fractional (g, f)-factors excluding H if and only if

g(S)−f(T)+∑x∈TdG−S(x)≥∑x∈TdH(x)−eH(S,T)

for arbitrary subset S of V(G), where T = {x ∈ V(G) – S|dG–S(x) – dH(x) + eH(x, S) < f(x)}.

Clearly, this sufficient and necessary condition has the following equal version.

Theorem 4

Let G be a graph and g, f : V(G) → ℤ+ be two integer-valued functions with g(x) ≤ f(x) for each x ∈ V(G). Let H be a subgraph of G. Then G admits all fractional (g, f)-factors excluding H if and only if

g(S)−f(T)+∑x∈TdG−S(x)≥∑x∈TdH(x)−eH(S,T)

for arbitrary non-disjoint subsets S, T ⊆ V(G).

Set g(x) = a, f(x) = b for each x ∈ V(G), we immediate get the Corollary below.

Corollary 3

Let G be a graph, and a and b be two integers where 1 ≤ a ≤ b. Let H be a subgraph of G. Then G admits all fractional [a, b]-factors excluding H if and only if

a|S|+∑x∈T(dG−S(x)−dH(x)+eH(x,S)−b)≥0,

where T = {x ∈ V(G) – S|dG–S(x) – dH(x) + eH(x, S) < b}.

Again, this sufficient and necessary condition can be stated as follows.

Corollary 4

Let a and b be two integers with 1 ≤ a ≤ b, and let G be a graph. Let H be a subgraph of G. So G admits all fractional [a, b]-factors excluding H if and only if

a|S|+∑x∈T(dG−S(x)−dH(x)+eH(x,S)−b)≥0

for arbitrary non-disjoint subsets S, T ⊆ V(G).

Zhou and Sun [8] introduced the concept of all fractional (a, b, n′)-critical graphs. A graph G is named as an all fractional (a, b, n′)-critical graph if the remaining graph of G has all fractional [a, b]-factors, even though any n′ vertices of G are deleted. Also, they presented the necessary and valuable situation for a graph to be all fractional (a, b, n′)-critical.

Theorem 5

(Zhou and Sun [8]) Let a, b and n′ be nonnegative integers with 1 ≤ a ≤ b, and let G be a graph of order n with n ≥ a + n′ + 1. Then G is all fractional (a, b, n′)-critical if and only if for any S ⊆ V(G) with |S| ≥ n′,

a|S|+∑x∈TdG−S(x)−b|T|≥an′,

where T = {x : x ∈ V(G) ∖ S, dG–S(x) < b}.

Equally, the above necessary and sufficient condition can be re-written as follows.

Theorem 6

Assume a, b and n′ be nonnegative integers with 1 ≤ a ≤ b, hence suppose G is a graph of order n with n ≥ a + n′ + 1. Then, G is all fractional (a, b, n′)-critical if and only if

a|S|+∑x∈TdG−S(x)−b|T|≥an′

for arbitrary non-disjoint subsets S, T ⊆ V(G) with |S| ≥ n′.

More results from this topic, regarding fractional factor, fractional deleted graphs, fractional critical and other network applications can be found in Zhou et al. [9], Jin [10], Gao and Wang [11] and [12], Gao et al. [13], [14] and [15], and Guirao and Luo [16].

In this paper, we first introduce some new concepts. A graph G is named as an all fractional (g, f, m)-deleted graph if the remaining graph of G has all fractional (g, f)-factors, when any m edges of G are deleted. If for any x ∈ V(G), we have g(x) = a and f(x) = b, then an all fractional (g, f, m)-deleted graph becomes an all fractional (a, b, m)-deleted graph, i.e., a graph G is named as an all fractional (a, b, m)-deleted graph if the remaining graph of G has all fractional [a, b]-factors, when any m edges of G are deleted. Following this definition, we clearly see that Theorem 3 and Theorem 4 show the necessary and sufficient condition of all fractional (g, f, m)-deleted graph with |E(H)| = m respectively, and Corollary 3 and Corollary 4 present the necessary and sufficient condition of all fractional (a, b, m)-deleted graph respectively.

Next, we combine two concepts, all fractional (g, f, m)-deleted graph and all fractional (g, f, m)-critical graph together. A graph G is named as an all fractional (g, f, n′, m)-critical deleted graph if the remaining graph of G is still an all fractional (g, f, m)-deleted graph, when any n′ vertices of G are deleted. If g(x) = a, f(x) = b for each x ∈ V(G), every fractional (g, f, n′, m)-critical deleted graph becomes all fractional (a, b, n′, m)-critical deleted graph, it means, after deleting any n′ vertices of G the remaining graph of G is still an all fractional (a, b, m)-deleted graph.

The concept of all fractional (g, f, n′, m)-critical deleted graph reflects the feasibility of data transmission in data transmission networks, in the case of some sites or channels being damaged. At the same time, it also provides theoretical support for SDN: in the peak data transmission, some sites and communications are often in the situation of information congestion, so we regard the site and channel in a blocked state as the vertices and edges that need to be deleted. Then, we consider the existence of fractional factors in the resulting subgraph. Thus, it inspires us to study the sufficient condition of all fractional (g, f, n′, m)-critical deleted graph from the graph structure prospect. It will imply which structures of network can ensure the success of data transmission, and the theoretical results obtained in our article can help us carry out the network design.

In this paper, we explore relations between the neighborhood union condition and all fractional (g, f, n′, m)-critical deleted graphs. The first key result can be formulated as follows.

Theorem 7

Assume a, b, n′ and m are four non-negative integers satisfying 2 ≤ a ≤ b. Assume G to be a graph with δ(G)≥(a+b−1)2+4b4a+m+n′ and n≥2(a+b)(a+b+m−1)a+n′. Let g and f be two integer functions which are defined on V(G) such that a ≤ g(x) ≤ f(x) ≤ b for each x ∈ V(G). If |NG(u) ∪ NG(v)| ≥ bn+an′a+b for arbitrary two nonadjacent vertices u and v in G, then G is all fractional (g, f, n′, m)-critical deleted.

Set n′ = 0 in Theorem 7, then we get the following corollary.

Corollary 5

Assume a, b and m be three non-negative integers satisfying 2 ≤ a ≤ b. Assume G is a graph with δ(G)≥(a+b−1)2+4b4a+m and n≥2(a+b)(a+b+m−1)a. Let g and f be two integer functions whose definition can be found on V(G) such that a ≤ g(x) ≤ f(x) ≤ b for each x ∈ V(G). If |NG(u) ∪ NG(v)| ≥ bna+b for arbitrary two nonadjacent vertices u and v in G, then G is all fractional (g, f, m)-deleted.

By setting m = 0 in Theorem 7, the following corollary is obtained.

Corollary 6

Assume a, b and n′ to be three non-negative integers satisfying 2 ≤ a ≤ b. Let G be a graph with δ(G) ≥ ((a+b−1)2+4b)4a+n′ and n≥2(a+b)(a+b−1)a+n′. Let g and f be two integer functions whose definition can be found on V(G) such that a ≤ g(x) ≤ f(x) ≤ b for each x ∈ V(G). If |NG(u) ∪ NG(v)| ≥ bn+an′a+b for arbitrary two nonadjacent vertices u and v in G, then G is all fractional (g, f, n′)-critical.

Set g(x) = a and f(x) = b for any x ∈ V(G), then we get the following condition for all fractional (a, b, n′, m)-critical deleted graph.

Corollary 7

Let a, b, n′ and m be four non-negative integers satisfying 2 ≤ a ≤ b. Let G be a graph with δ(G)≥(a+b−1)2+4b4a + m + n′ and n≥2(a+b)(a+b+m−1)a+n′. If |NG(u) ∪ NG(v)| ≥ bn+an′a+b for arbitrary two nonadjacent vertices u and v in G, then G is all fractional (a, b, n′, m)-critical deleted.

Set n′ = 0 in Corollary 7, then the corollary below can be obtained.

Corollary 8

Let a, b and m be three non-negative integers satisfy 2 ≤ a ≤ b. Let G be a graph with δ(G)≥(a+b−1)2+4b4a + m and n ≥ 2(a+b)(a+b+m−1)a. If |NG(u) ∪ NG(v)| ≥ bna+b for arbitrary two nonadjacent vertices u and v in G, then G is all fractional (a, b, m)-deleted.

Set m = 0 in Corollary 7, then the following corollary is obtained.

Corollary 9

Let a, b and n′ be three non-negative integers satisfy 2 ≤ a ≤ b. Let G be a graph with δ(G) ≥ (a+b−1)2+4b4a + n′ and n≥2(a+b)(a+b−1)a+n′. If |NG(u) ∪ NG(v)| ≥ bn+an′a+b for arbitrary two nonadjacent vertices u and v in G, then G is all fractional (a, b, n′)-critical.

Our second main result is stated as follows.

Theorem 8

Let a, b, n′ and m be four non-negative integers satisfying 2 ≤ a ≤ b. Let G be a graph with order n≥(a+2b−3)(a+b−2)a+an′a−1+m. Let g and f be two integer functions whose definition can be found on V(G) such that a ≤ g(x) ≤ f(x) ≤ b for each x ∈ V(G). Suppose that

NG(X)=V(G)if|X|≥⌊(an−a−an′−2m)n(a+b−1)(n−1)⌋;

or

NG(X)≥(a+b−1)(n−1)an−a−an′−2m|X|if|X|<⌊(an−a−an′−2m)n(a+b−1)(n−1)⌋

for any subset X ⊆ V(G). Then G is all fractional (g, f, n′, m)-critical deleted.

Set n′ = 0 in Theorem 8, then we yield the following corollary.

Corollary 10

Let a, b, and m be three non-negative integers satisfy 2≤ a ≤ b. Let G be a graph with order n ≥ (a+2b−3)(a+b−2)a + m. Let g and f be two integer functions defined on V(G) such that a ≤ g(x) ≤ f(x) ≤ b for each x ∈ V(G). Suppose that

NG(X)=V(G)if|X|≥⌊(an−a−2m)n(a+b−1)(n−1)⌋;

or

NG(X)≥(a+b−1)(n−1)an−a−2m|X|if|X|<⌊(an−a−2m)n(a+b−1)(n−1)⌋

for any subset X ⊆ V(G). Then G is all fractional (g, f, m)-deleted.

Set m = 0 in Theorem 8, then the Corollary below can be inferred.

Corollary 11

Let a, b and n′ be three non-negative integers satisfy 2≤ a ≤ b. Let G be a graph with order n ≥ (a+2b−3)(a+b−2)a+an′a−1. Let g and f be two integer functions defined on V(G) such that a ≤ g(x) ≤ f(x) ≤ b for each x ∈ V(G). Suppose that

NG(X)=V(G)if|X|≥⌊(an−a−an′)n(a+b−1)(n−1)⌋;

or

NG(X)≥(a+b−1)(n−1)an−a−an′|X|if|X|<⌊(an−a−an′)n(a+b−1)(n−1)⌋

for any subset X ⊆ V(G). Then G is all fractional (g, f, n′)-critical.

Set g(x) = a and f(x) = b for any x ∈ V(G), then we get the following condition for an all fractional (a, b, n′, m)-critical deleted graph.

Corollary 12

Let a, b, n′ and m be four non-negative integers satisfying 2 ≤ a ≤ b. Let G be a graph with order n≥(a+2b−3)(a+b−2)a+an′a−1+m. Suppose that

NG(X)=V(G)if|X|≥⌊(an−a−an′−2m)n(a+b−1)(n−1)⌋;

or

NG(X)≥(a+b−1)(n−1)an−a−an′−2m|X|if|X|<⌊(an−a−an′−2m)n(a+b−1)(n−1)⌋

for any subset X ⊆ V(G). Then G is all fractional (a, b, n′, m)-critical deleted.

Set n′ = 0 in Corollary 12, then we have the following corollary.

Corollary 13

Let a, b and m be three non-negative integers satisfy 2 ≤ a ≤ b. Let G be a graph with order n ≥ (a+2b−3)(a+b−2)a + m. Suppose that

NG(X)=V(G)if|X|≥⌊(an−a−2m)n(a+b−1)(n−1)⌋;

or

NG(X)≥(a+b−1)(n−1)an−a−2m|X|if|X|<⌊(an−a−2m)n(a+b−1)(n−1)⌋

for any subset X ⊆ V(G). Then G is all fractional (a, b, m)-deleted.

Set m = 0 in Corollary 12, then we deduce the following corollary.

Corollary 14

Let a, b and n′ be three non-negative integers satisfying 2 ≤ a ≤ b. Let G be a graph with order n ≥ (a+2b−3)(a+b−2)a+an′a−1. Suppose that

NG(X)=V(G)if|X|≥⌊(an−a−an′)n(a+b−1)(n−1)⌋;

or

NG(X)≥(a+b−1)(n−1)an−a−an′|X|if|X|<⌊(an−a−an′)n(a+b−1)(n−1)⌋

for any subset X ⊆ V(G). Then G is all fractional (a, b, n′)-critical deleted.

2 Proof of main results

2.1 The necessary and sufficient condition of all fractional (g, f, n′, m)-critical deleted graphs

To prove the main results in our paper, we first determine the necessary and sufficient condition of all fractional (g, f, n′, m)-critical deleted graphs which is manifested as follows.

Theorem 9

a, b, m and n′ are assumed to be nonnegative integers satisfying 1 ≤ a ≤ b, and G is let to be a graph of order n with n ≥ b + n′ + m + 1. Let g, f : V(G) → ℤ+ be two valued functions with a ≤ g(x) ≤ f(x) ≤ b for each x ∈ V(G), and H will be a subgraph of G with m edges. After that, G is all fractional (g, f, n′, m)-critical deleted if and only if for any S ⊆ V(G) with |S| ≥ n′,

g(S)−f(T)+∑x∈TdG−S(x)≥maxU⊆S,|U|=n′,H⊆E(G−U),|H|=m{g(U)+∑x∈TdH(x)−eH(S,T)},

where

T={x:x∈V(G)∖S,dG−S(x)−dH(x)+eH(x,S)<f(x)}.(1)

The equal version of Theorem 9 is stated as follows.

Theorem 10

a, b, m and n′ are assumed to be nonnegative integers satisfying 1 ≤ a ≤ b, and let G be a graph of order n with n ≥ b + n′ + m + 1. Let g, f : V(G) → ℤ+ be two valued functions with a ≤ g(x) ≤ f(x) ≤ b for each x ∈ V(G), and H be a subgraph of G with m edges. Then, G is all fractional (g, f, n′, m)-critical deleted if and only if

g(S)−f(T)+∑x∈TdG−S(x)≥maxU⊆S,|U|=n′,H⊆E(G−U),|H|=m{g(U)+∑x∈TdH(x)−eH(S,T)},

for any non-disjoint subsets S, T ⊆ V(G) with |S| ≥ n′.

Set g(x) = a and f(x) = b for every x ∈ V(G), and the following corollary on the necessary and sufficient condition of all fractional (a, b, n′, m)-critical deleted graph is obtained.

Corollary 15

Assume a, b, m and n′ be nonnegative integers satisfying 1 ≤ a ≤ b, and G be a graph of order n with n ≥ a + n′ + m + 1. H is assumed to be a subgraph of G with m edges. G is all fractional (a, b, n′, m)-critical deleted if and only if for any S ⊆ V(G) with |S| ≥ n′,

a|S|+∑x∈T(dG−S(x)−dH(x)+eH(x,S)−b)≥an′,

where T = {x ∈ V(G) – S|dG–S(x) – dH(x) + eH(x, S) < b}.

Clearly, the above necessary and sufficient condition has the equal version which is stated as follows.

Corollary 16

Assume a, b, m and n′ to be nonnegative integers satisfying 1 ≤ a ≤ b, and G a graph of order n with n ≥ a + n′ + m + 1. H is assumed to be a subgraph of G with m edges. G is all fractional (a, b, n′, m)-critical deleted if and only if

a|S|+∑x∈T(dG−S(x)−dH(x)+eH(x,S)−b)≥an′

for any non-disjoint subsets S, T ⊆ V(G) with |S| ≥ n′.

Now, we present the detailed proof of Theorem 9.

Proof of Theorem 9

Assume U ⊆ S ⊆ V(G) with |U| = n′. Let S′ = S∖U and G′ = G – U. Then we have G′ – S′ = G – S. Moreover, let

T′={x:x∈V(G′)∖S′,dG′−S′(x)−dH(x) +eH(x,S′)<f(x)},(2)

then by the definition of (1), we get T′ = T. Furthermore, we infer

g(S′)+∑x∈T′(dG′−S′(x)−dH(x)+eH(x,S′)−f(x))=g(S)+∑x∈T(dG−S(x)−dH(x)+eH(x,S)−f(x))−g(U),

so that

g(S′)+∑x∈T′(dG′−S′(x)−dH(x)+eH(x,S′)−f(x))≥0⇔g(S)−f(T)+∑x∈TdG−S(x)≥maxU⊆S,|U|=n′,H⊆E(G−U),|H|=m{g(U)+∑x∈TdH(x)−eH(S,T)}.(3)

First, assume G be all fractional (g, f, n′, m)-critical deleted, and let S, S′, U, T′ and G′ be described as the above. So G′ = G – U is all fractional (g, f, m)-deleted, thus in terms of Theorem 3, we have

g(S′)+∑x∈T′(dG′−S′(x)−dH(x)+eH(x,S′)−f(x))≥0.

Hence, using (3), we infer that

g(S)−f(T)+∑x∈TdG−S(x)≥maxU⊆S,|U|=n′,H⊆E(G−U),|H|=m{g(U)+∑x∈TdH(x)−eH(S,T)}

holds for any S ⊆ V(G) with |S| ≥ n′.

Conversely, suppose that

g(S)−f(T)+∑x∈TdG−S(x)≥maxU⊆S,|U|=n′,H⊆E(G−U),|H|=m{g(U)+∑x∈TdH(x)−eH(S,T)}

holds for any S ⊆ V(G) with |S| ≥ n′. Let U ⊆ V(G) satisfy |U| = n′ and G′ = G – U. For any S′ ⊆ V(G′), define T′ according to (2) and let S = S′ ∪ U. Thus, S′ = S∖U, and in light of (3) we have

g(S′)+∑x∈T′(dG′−S′(x)−dH(x)+eH(x,S′)−f(x))≥0

holds for any S′ ⊆ V(G′). It implies that G′ = G – U is an all fractional (g, f, m)-deleted graph by Theorem 3. And, this establishes for any U ⊆ V(G) with |U| = n′, and therefore G is all fractional (g, f, n′, m)-critical deleted.

In all, this completes the proof of Theorem 9.

2.2 Proof of Theorem 7

In this part, we mainly present the detailed proof of Theorem 7.

Suppose G satisfies the hypothesis of Theorem 7, but is not an all fractional (g, f, n′, m)-critical deleted graph. Then via Theorem 10 and the fact that ∑x∈TdH(x) − eH(T, S) ≤ 2m for any H ⊆ E(G) with m edges, there is a non-disjoint subset S, T ⊆ V(G) satisfying

a|S|−b|T|+∑x∈TdG−S(x)−an′−2m≤a(|S|−n′)+∑x∈T(dG−S(x)−dH(x)+eH(x,S)−b)≤g(S−U)+∑x∈T(dG−S(x)−dH(x)+eH(x,S)−f(x))≤−1.(4)

S and T are chosen such that |T| is minimum. The subsets S and T ∖ {x} satisfy (4), when there is a x ∈ T which can satisfy dG−S(x) ≥ g(x), This is conflicted with the selection rule of S and T. It infers that dG−S(x) ≤ g(x) − 1 ≤ b − 1 for any x ∈ T.

Note that |T| ≠ ∅, otherwise we have ∑x∈TdH(x) − eH(T, S) = 0 and a(|S| − n′) < 0, contradicting (4). We write NT(x) = NG(x) ∩ T and NT[x] = (NG(x) ∩ T) ∪ {x} for any vertex x ∈ T.

Let

d1=min{dG−S(x)|x∈T}

and x1 be a vertex in T with dG−S(x1) = d1. If T − NT[x1] ≠ ∅, we further set

d2=min{dG−S(x)|x∈T−NT[x1]},

and x2 is a vertex in T − NT[x1] with dG−S(x2) = d2. Hence, we have d1 ≤ d2 ≤ b − 1 and |NG(x1) ∪ NG(x2)| ≤ |S| + d1 + d2.

The following discussion is divided into two cases.

  1. T = NT[x1].

    Since δ(G)≥(a+b−1)2+4b4a + m + n′, |T| ≤ d1 + 1 ≤ b and d1 + |S| ≥ dG(x1) ≥ δ(G), by (4) and the definition of d1, we have

    an′+2m−1≥a|S|−b|T|+∑x∈TdG−S(x)≥a|S|−b|T|+d1|T|≥a(δ(G)−d1)−(b−d1)|T|≥a(δ(G)−d1)−(b−d1)(d1+1)=d12−(a+b−1)d1+aδ(G)−b≥(d1−a+b−12)2+an′+2m≥an′+2m,

    a contradiction.

  2. T − NT[x1] ≠ ∅.

    Let p = |NT[x1]|, then we get d1 ≥ p − 1. In view of T − NT[x1] ≠ ∅, we obtain |T| ≥ p + 1. By virtue of n − |S| − |T| ≥ 0, d1 − d2 ≤ 0, b − d2 ≥ 1, and (4), we yield

    (n−|S|−|T|)(b−d2)≥a|S|−b|T|+∑x∈TdG−S(x)−2m−an′+1≥a|S|−b|T|+d1p+d2(|T|−p)−2m−an′+1=a|S|+(d1−d2)p+(d2−b)|T|−2m−an′+1≥a|S|+(d1−d2)(d1+1)+(d2−b)|T|−2m−an′+1.

    It reveals

    (n−|S|)(b−d2)≥a|S|+(d1−d2)(d1+1)−2m−an′+1.

    By arranging the above inequality, we infer

    n(b−d2)−(a+b−d2)|S|+(d2−d1)(d1+1)+2m+an′−1≥0(5)

    Since vertices x1 and x2 are non-adjacent, using the neighborhood condition of the Theorem 7, we deduce

    bn+an′a+b≤|NG(x1)∪NG(x2)|≤|S|+d1+d2,

    which implies

    |S|≥bn+an′a+b−(d1+d2).(6)

    In terms of (5), (6), d1 ≤ d2 ≤ b − 1, and n ≥ 2(a+b)(a+b+m−1)a + n′, we get

    0≤n(b−d2)−(a+b−d2)|S|+(d2−d1)(d1+1)+2m+an′−1≤n(b−d2)−(a+b−d2)(bn+an′a+b−(d1+d2))+(d2−d1)(d1+1)+2m+an′−1=−and2a+b+(a+b−1)d2−d22+(a+b−1)d1−d12−(an′−d2an′a+b)+2m+an′−1≤−and1a+b+(a+b−1)d1−d12+(a+b−1)d1−d12+2m+d1an′a+b−1=−and1a+b+2(a+b)d1−2d12+2m+d1an′a+b−1≤2d1−2d12−1≤−1,

    a contradiction.

Therefore, the desired result is proved.

2.3 Proof of Theorem 8

In the following part, we prove the second main result in this paper.

Assume that G satisfies the hypothesis of Theorem 8, but is not a fractional all (g, f, n′, m)-critical deleted graph. Then via Theorem 10 and the fact that ∑x∈TdH(x) − eH(T, S) ≤ 2m for any H ⊆ E(G) with m edges, there is a non-disjoint subset S, T ⊆ V(G) satisfying

a|S|−b|T|+∑x∈TdG−S(x)−an′−2m≤a(|S|−n′)+∑x∈T(dG−S(x)−dH(x)+eH(x,S)−b)≤g(S−U)+∑x∈T(dG−S(x)−dH(x)+eH(x,S)−f(x))≤−1.(7)

As depicted in the former subsection, S and T are selected such that |T| is the minimum. We get T ≠ ∅ and dG−S(x) ≤ g(x) − 1 ≤ b − 1 for any x ∈ T.

The Claim below is firstly shown here.

Claim 1

G is assumed to be a graph of order n which satisfies the hypothesis of Theorem 8. After that, we obtain

δ(G)≥(b−1)n+a+an′+2ma+b−1.

Proof of Claim 1

Assume x to be a vertex of a graph G satisfying dG(x) = δ(G), and X = V(G) ∖ NG(x). Clearly, x ∉ NG(X), and hence NG(X) ≠ V(G). Combining this with the hypothesis of Theorem 8, we infer

NG(X)≥(a+b−1)(n−1)an−a−an′−2m|X|.

By virtue of |X| = n − δ(G) and |NG(X)| ≤ n − 1, we deduce

n−1≥|NG(X)|≥(a+b−1)(n−1)an−a−an′−2m|X|=(a+b−1)(n−1)an−a−an′−2m(n−δ(G)),

which implies

δ(G)≥(b−1)n+a+an′+2ma+b−1.

Claim 1 is proved.

By setting d = min{dG−S(x) : x ∈ T}, we have 0 ≤ d ≤ b − 1. Select x1 ∈ T with dG−S(x1) = d. In light of δ(G) ≤ dG(x1) ≤ dG−S(x1) + |S| = d + |S| and Claim 1, we yield

|S|≥δ(G)−d≥(b−1)n+a+an′+2ma+b−1−d.(8)

In what follows, we discuss three cases for the value of d.

  1. 2 ≤ d ≤ b − 1.

    By means of (8) and |S| + |T| ≤ n, we obtain

    a|S|+∑x∈TdG−S(x)−b|T|−an′−2m≥a|S|+d|T|−b|T|−an′−2m≥a|S|−(b−d)(n−|S|)−an′−2m=(a+b−d)|S|−(b−d)n−an′−2m≥(a+b−d)((b−1)n+a+an′+2ma+b−1−d)−(b−d)n−an′−2m.

    Let h(d) = (a + b − d)( (b−1)n+a+an′+2ma+b−1 − d) − (b − d)n − an′ − 2m, then we have

    a|S|+∑x∈TdG−S(x)−b|T|−an′−2m≥h(d).(9)

    Using 2 ≤ d ≤ b − 1 and n ≥ (a+2b−3)(a+b−2)a+an′a−1 + m, we get

    h′(d)=−((b−1)n+a+an′+2ma+b−1−d)−(a+b−d)+n=2d+an−a−an′−2ma+b−1−a−b≥4+an−a−an′−2ma+b−1−a−b>0.

    Combining this with 2 ≤ d ≤ b − 1, we infer

    h(d)≥f(2).(10)

    By virtue of (7), (9) and (10), we derive

    an′+2m−1≥h(d)≥h(2)=(a+b−2)((b−1)n+a+an′+2ma+b−1−2)−(b−2)n,

    which implies

    n≤(a+2b−3)(a+b−2)−1a+2ma+n′<(a+2b−3)(a+b−2)a+an′a−1+m,

    which conflicts with n ≥ (a+2b−3)(a+b−2)a+an′a−1 + m.

  2. d = 1.

    In this case, we first prove the following two claims.

Claim 2

|T| ≤ ⌊(an−a−an′−2m)n(a+b−1)(n−1)⌋.

Proof of Claim 2

Assume that |T| ≥ ⌊(an−a−an′−2m)n(a+b−1)(n−1)⌋ + 1. Followed from dG−S(x1) = d = 1, we have

|T∖NG(x1)|≥|T|−1≥⌊(an−a−an′−2m)n(a+b−1)(n−1)⌋.(11)

In view of (11) and the hypothesis of Theorem 8, we obtain

NG(T∖NG(x1))=V(G).(12)

On the other hand, it is clear that

x1∉NG(T∖NG(x1)),

which conflicts with (12).

Claim 3

|T| ≤ an−a−an′−2ma+b−1.

Proof of Claim 3

Assume that |T| > an−a−an′−2ma+b−1 . In terms of (8) and d = 1, we yield

n≥|S|+|T|>(b−1)n+a+an′+2ma+b−1−1+an−a−an′−2ma+b−1=n−1,

which means

|S|+|T|=n.(13)

According to (7), (13) and Claim 2, we get

an′+2m−1≥a|S|+∑x∈TdG−S(x)−b|T|≥a|S|+|T|−b|T|=a(n−|T|)−(b−1)|T|=an−(a+b−1)|T|≥an−(a+b−1)(an−a−an′−2m)n(a+b−1)(n−1)=an−(an−a−an′−2m)nn−1≥an′+2m,

a contradiction. Hence the Claim 3 is hold.

Now, we set t′ = |{x : x ∈ T, dG−S(x) = 1}|. It is obvious that t′ ≥ 1 and |T| ≥ t′. In light of (8), d = 1 and Claim 3, we obtain

a|S|+∑x∈TdG−S(x)−b|T|−an′−2m≥a|S|+2|T|−t′−b|T|−an′−2m=a|S|−(b−2)|T|−t′−an′−2m≥a((b−1)n+a+an′+2ma+b−1−1)−an′−2m−(b−2)an−a−an′−2ma+b−1−t′=an−a−an′−2ma+b−1−t′≥|T|−t′≥0,

which conflicts with (7).

  1. d = 0.

Let r = |{x : x ∈ T, dG−S(x) = 0}| and Y = V(G) ∖ S. Obviously, we have r ≥ 1 and NG(Y) ≠ V(G). Combining these with the hypothesis of Theorem 8, we derive

n−r≥|NG(Y)|≥(a+b−1)(n−1)an−a−an′−2m|Y|=(a+b−1)(n−1)an−a−an′−2m(n−|S|),

which implies,

|S|≥n−(n−r)(an−a−an′−2m)(a+b−1)(n−1).(14)

In view of n ≥ (a+2b−3)(a+b−2)a+an′a−1 + m, we ensure that

an−a−an′−2mn−1>1.(15)

By means of (7), (14), (15) and |S| + |T| ≤ n, we infer

an′+2m−1≥a|S|+∑x∈TdG−S(x)−b|T|≥a|S|−(b−1)|T|−r≥a|S|−(b−1)(n−|S|)−r=(a+b−1)|S|−(b−1)n−r≥(a+b−1)(n−(n−r)(an−a−an′−2m)(a+b−1)(n−1))−(b−1)n−r=an−(n−r)(an−a−an′−2m)n−1−r≥an−(n−1)(an−a−an′−2m)n−1−1=an−(an−a−an′−2m)−1=an′+2m+a−1>an′+2m,

a contradiction.

In conclusion, we complete the proof of Theorem 8.

3 Sharpness

The most likely in the sense that we can’t replace bn+an′a+b by bn+an′a+b − 1 is the lower bound on the condition |NG(x) ∪ NG(y)| ≥ bn+an′a+b in Theorem 7. We present this by constructing a graph G = (bt + n′)K1 ∨ (at + 1)K1, where a and b are two nonnegative integers with 2 ≤ a ≤ b and t is a large sufficiently positive integer. Obviously,

|V(G)|=n=(a+b)t+n′+1

and

bn+an′a+b>|NG(x)∪NG(y)|=bt+n′>bn+an′a+b−1

for any non-adjacent vertices x, y ∈ V((at + 1)K1). Set S = V((bt + n′)K1), T = V((at + 1)K1). Let U ⊂ S with |U| = n′. Let H be a subgraph of T with m edges. Obviously, |S| = bt + n′, |T| = at + 1, ∑x∈TdG−S(x) = 0 and ∑x∈TdH(x) − eH(S, T) = 0. Furthermore, let g(x) = a for any x ∈ S, and f(x) = b for any x ∈ T. Hence, we obtain

g(S−U)+∑x∈T(dG−S(x)−dH(x)+eH(x,S)−f(x))=g(S−U)−f(T)=abt−b(at+1)=−b<0.

By Theorem 10, G is not all fractional (g, f, n′, m)-critical deleted.

The bound of the hypothesis in Theorem 8 is the best possible in some sense, i.e., it can’t be replaced by NG(X) = V(G) or |NG(X)| ≥ (a+b−1)(n−1)an−a−an′−2m |X| for any X ⊆ V(G) (i.e., the restriction condition on |X| is necessary). We explain this by constructing a graph G as follows. Let V(G) = S ∪ T with S ∩ T = ∅, |S| = (b − 1)t + n′ and |T| = at + 1, and T = {x1, x2, ⋯, x2t′}, where n′ ≥ 0, b ≥ a ≥ 2 are integers, a and t are odd integers. Obviously, 2t′ = at + 1. For y ∈ S, we write NG(y) = V(G) ∖ {y}. For x ∈ T, we write NG(x) = S ∪ {x′}, where {x, x′} = {x2i−1, x2i} for some 1 ≤ i ≤ t′. It is obvious that n = (b − 1)t + n′ + at + 1. Next, we show that NG(X) = V(G) or |NG(X)| ≥ (a+b−1)(n−1)an−a−an′−2m |X| holds for any X ⊆ V(G). Apparently, NG(X) = V(G) if |X ∖ S| ≥ 2, or |X ∖ S| = 1 and |X ∖ T| ≥ 1 for any X ⊆ V(G). If |X| = 1 and X ⊆ S, then |NG(X)| = |V(G)| − 1 = n − 1 > (a+b−1)(n−1)at(a+b−1)=(a+b−1)(n−1)an−a−an′−2m=(a+b−1)(n−1)an−a−an′−2m |X|. Thus, we may suppose X ⊆ T. Note that |NG(X)| = |S| + |X| = (b − 1)t + n′ + |X|. Thus, |NG(X)| ≥ (a+b−1)(n−1)an−a−an′−2m |X| holds if and only if (b − 1)t + n′ + |X| ≥ (a+b−1)(n−1)b(n−1)−bn′−2m |X|, which is equivalent to |X| ≤ at. Clearly, |NG(X)| ≥ (a+b−1)(n−1)b(n−1)−bn′−2m |X| holds for any X ⊆ T with X ≠ T. If X = T, then NG(X) = V(G). As a result, NG(X) = V(G) or |NG(X)| ≥ (a+b−1)(n−1)an−a−an′−2m |X| holds for any X ⊆ V(G). Then, we show that G is not all fractional (g, f, n′, m)-critical deleted. For above S and T, it is obvious that |S| > n′ and dG−S(x) = 1 for each x ∈ T. Let g(x) = a for any x ∈ S, and f(x) = b for any x ∈ T. Let H be a subgraph of T with m edges. Therefore, in terms of ∑x∈TdG−S(x) − ∑x∈TdH(x) + eH(S, T) ≥ 0 holds for any H, we obtain

g(S−U)+∑x∈T(dG−S(x)−dH(x)+eH(x,S)−f(x))=a(|S|−n′)+(∑x∈TdG−S(x)−∑x∈TdH(x)+eH(S,T))−b|T|≥a(b−1)t−b(at+1)=−at−bt<0.

It follows from Theorem 10 that G is not all fractional (g, f, n′, m)-critical deleted.

4 Conclusions

In recent years, the problem of fractional factor in graphs has raised much attention in the field of graph theory and computer networks. In this paper, we consider the theoretical problems in data transmission networks when some sites and channels are not available in the certain time. The relationship between neighborhood conditions and a graph to be all fractional (g, f, n’, m)- critical deleted is discussed. Two sufficient neighborhood conditions are obtained, and the sharpness of conditions is presented. The theoretical conclusions we yield in this paper have potential applications in network design and information transmission.

  1. Conflict of Interest

    Conflict of Interests: The authors hereby declare that there is no conflict of interests regarding the publication of this paper.

Acknowledgement

We thank the reviewers for their insightful comments in the improvement of the paper. The work has been partially supported by Postdoctoral Research Grant of China (2017M621690), National Science Foundation of China (11401519), postdoctoral research grant in Jiangsu province (1701128B).

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/TIT.2016.2619713Search in Google Scholar

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

[6] Lu H.L., Simplified existence theorems on all fractional [a, b]-factors, Discrete Applied Mathematics, 2013, 161, 2075-2078.10.1016/j.dam.2013.02.006Search in Google Scholar

[7] Zhou S.Z., Zhang T., Some existence theorems on all fractional (g, f)-factors with prescribed properties, Acta Mathematicae Applicatae Sinica, English Series. In press.Search in Google Scholar

[8] Zhou S.Z., Sun Z.R., On all fractional (a, b, k)-critical graphs, Acta Mathematica Sinica, 2014, 30, 696-702.10.1007/s10114-014-2629-2Search in Google Scholar

[9] Zhou S.Z., Xu L., Xu Y., A sufficient condition for the existence of a k-factor excluding a given r-factor, Appl. Math. Nonl. Sc., 2017, 2, 13-20.10.21042/AMNS.2017.1.00002Search in Google Scholar

[10] Jin J.H., Multiple solutions of the Kirchhoff-type problem in RN, Appl. Math. Nonl. Sc., 2016, 1, 229-238.10.21042/AMNS.2016.1.00017Search in Google Scholar

[11] 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

[12] Gao W., Wang W.F., A neighborhood union condition for fractional (k, m)-deleted graphs, Ars Combin., 2014, 113A, 225-233.Search in Google Scholar

[13] 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., 2018, 17, 231-243.10.1007/s12346-016-0222-zSearch in Google Scholar

[14] Gao W., Liang L., Xu T.W., Zhou J.X., Degree conditions for fractional (g, f, n′, m)-critical deleted graphs and fractional ID-(g, f, m)-deleted graphs, Bull. Malays. Math. Sci. Soc., 2016, 39, 315-330.10.1007/s40840-015-0194-1Search in Google Scholar

[15] Gao W., Liang L., Xu T.W., Zhou J.X., Tight toughness condition for fractional (g, f, n)-critical graphs, J. Korean Math. Soc., 2014, 51, 55-65.10.4134/JKMS.2014.51.1.055Search in Google Scholar

[16] 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

Received: 2018-04-16
Accepted: 2018-05-15
Published Online: 2018-08-20

© 2018 Wei Gao et al, published by De Gruyter

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

Articles in the same Issue

  1. Regular Articles
  2. A modified Fermi-Walker derivative for inextensible flows of binormal spherical image
  3. Algebraic aspects of evolution partial differential equation arising in the study of constant elasticity of variance model from financial mathematics
  4. Three-dimensional atom localization via probe absorption in a cascade four-level atomic system
  5. Determination of the energy transitions and half-lives of Rubidium nuclei
  6. Three phase heat and mass transfer model for unsaturated soil freezing process: Part 1 - model development
  7. Three phase heat and mass transfer model for unsaturated soil freezing process: Part 2 - model validation
  8. Mathematical model for thermal and entropy analysis of thermal solar collectors by using Maxwell nanofluids with slip conditions, thermal radiation and variable thermal conductivity
  9. Constructing analytic solutions on the Tricomi equation
  10. Feynman diagrams and rooted maps
  11. New type of chaos synchronization in discrete-time systems: the F-M synchronization
  12. Unsteady flow of fractional Oldroyd-B fluids through rotating annulus
  13. A note on the uniqueness of 2D elastostatic problems formulated by different types of potential functions
  14. On the conservation laws and solutions of a (2+1) dimensional KdV-mKdV equation of mathematical physics
  15. Computational methods and traveling wave solutions for the fourth-order nonlinear Ablowitz-Kaup-Newell-Segur water wave dynamical equation via two methods and its applications
  16. Siewert solutions of transcendental equations, generalized Lambert functions and physical applications
  17. Numerical solution of mixed convection flow of an MHD Jeffery fluid over an exponentially stretching sheet in the presence of thermal radiation and chemical reaction
  18. A new three-dimensional chaotic flow with one stable equilibrium: dynamical properties and complexity analysis
  19. Dynamics of a dry-rebounding drop: observations, simulations, and modeling
  20. Modeling the initial mechanical response and yielding behavior of gelled crude oil
  21. Lie symmetry analysis and conservation laws for the time fractional simplified modified Kawahara equation
  22. Solitary wave solutions of two KdV-type equations
  23. Applying industrial tomography to control and optimization flow systems
  24. Reconstructing time series into a complex network to assess the evolution dynamics of the correlations among energy prices
  25. An optimal solution for software testing case generation based on particle swarm optimization
  26. Optimal system, nonlinear self-adjointness and conservation laws for generalized shallow water wave equation
  27. Alternative methods for solving nonlinear two-point boundary value problems
  28. Global model simulation of OH production in pulsed-DC atmospheric pressure helium-air plasma jets
  29. Experimental investigation on optical vortex tweezers for microbubble trapping
  30. Joint measurements of optical parameters by irradiance scintillation and angle-of-arrival fluctuations
  31. M-polynomials and topological indices of hex-derived networks
  32. Generalized convergence analysis of the fractional order systems
  33. Porous flow characteristics of solution-gas drive in tight oil reservoirs
  34. Complementary wave solutions for the long-short wave resonance model via the extended trial equation method and the generalized Kudryashov method
  35. A Note on Koide’s Doubly Special Parametrization of Quark Masses
  36. On right-angled spherical Artin monoid of type Dn
  37. Gas flow regimes judgement in nanoporous media by digital core analysis
  38. 4 + n-dimensional water and waves on four and eleven-dimensional manifolds
  39. Stabilization and Analytic Approximate Solutions of an Optimal Control Problem
  40. On the equations of electrodynamics in a flat or curved spacetime and a possible interaction energy
  41. New prediction method for transient productivity of fractured five-spot patterns in low permeability reservoirs at high water cut stages
  42. The collinear equilibrium points in the restricted three body problem with triaxial primaries
  43. Detection of the damage threshold of fused silica components and morphologies of repaired damage sites based on the beam deflection method
  44. On the bivariate spectral quasi-linearization method for solving the two-dimensional Bratu problem
  45. Ion acoustic quasi-soliton in an electron-positron-ion plasma with superthermal electrons and positrons
  46. Analysis of projectile motion in view of conformable derivative
  47. Computing multiple ABC index and multiple GA index of some grid graphs
  48. Terahertz pulse imaging: A novel denoising method by combing the ant colony algorithm with the compressive sensing
  49. Characteristics of microscopic pore-throat structure of tight oil reservoirs in Sichuan Basin measured by rate-controlled mercury injection
  50. An activity window model for social interaction structure on Twitter
  51. Transient thermal regime trough the constitutive matrix applied to asynchronous electrical machine using the cell method
  52. On the zagreb polynomials of benzenoid systems
  53. Integrability analysis of the partial differential equation describing the classical bond-pricing model of mathematical finance
  54. The Greek parameters of a continuous arithmetic Asian option pricing model via Laplace Adomian decomposition method
  55. Quantifying the global solar radiation received in Pietermaritzburg, KwaZulu-Natal to motivate the consumption of solar technologies
  56. Sturm-Liouville difference equations having Bessel and hydrogen atom potential type
  57. Study on the response characteristics of oil wells after deep profile control in low permeability fractured reservoirs
  58. Depiction and analysis of a modified theta shaped double negative metamaterial for satellite application
  59. An attempt to geometrize electromagnetism
  60. Structure of traveling wave solutions for some nonlinear models via modified mathematical method
  61. Thermo-convective instability in a rotating ferromagnetic fluid layer with temperature modulation
  62. Construction of new solitary wave solutions of generalized Zakharov-Kuznetsov-Benjamin-Bona-Mahony and simplified modified form of Camassa-Holm equations
  63. Effect of magnetic field and heat source on Upper-convected-maxwell fluid in a porous channel
  64. Physical cues of biomaterials guide stem cell fate of differentiation: The effect of elasticity of cell culture biomaterials
  65. Shooting method analysis in wire coating withdrawing from a bath of Oldroyd 8-constant fluid with temperature dependent viscosity
  66. Rank correlation between centrality metrics in complex networks: an empirical study
  67. Special Issue: The 18th International Symposium on Electromagnetic Fields in Mechatronics, Electrical and Electronic Engineering
  68. Modeling of electric and heat processes in spot resistance welding of cross-wire steel bars
  69. Dynamic characteristics of triaxial active control magnetic bearing with asymmetric structure
  70. Design optimization of an axial-field eddy-current magnetic coupling based on magneto-thermal analytical model
  71. Thermal constitutive matrix applied to asynchronous electrical machine using the cell method
  72. Temperature distribution around thin electroconductive layers created on composite textile substrates
  73. Model of the multipolar engine with decreased cogging torque by asymmetrical distribution of the magnets
  74. Analysis of spatial thermal field in a magnetic bearing
  75. Use of the mathematical model of the ignition system to analyze the spark discharge, including the destruction of spark plug electrodes
  76. Assessment of short/long term electric field strength measurements for a pilot district
  77. Simulation study and experimental results for detection and classification of the transient capacitor inrush current using discrete wavelet transform and artificial intelligence
  78. Magnetic transmission gear finite element simulation with iron pole hysteresis
  79. Pulsed excitation terahertz tomography – multiparametric approach
  80. Low and high frequency model of three phase transformer by frequency response analysis measurement
  81. Multivariable polynomial fitting of controlled single-phase nonlinear load of input current total harmonic distortion
  82. Optimal design of a for middle-low-speed maglev trains
  83. Eddy current modeling in linear and nonlinear multifilamentary composite materials
  84. The visual attention saliency map for movie retrospection
  85. AC/DC current ratio in a current superimposition variable flux reluctance machine
  86. Influence of material uncertainties on the RLC parameters of wound inductors modeled using the finite element method
  87. Cogging force reduction in linear tubular flux switching permanent-magnet machines
  88. Modeling hysteresis curves of La(FeCoSi)13 compound near the transition point with the GRUCAD model
  89. Electro-magneto-hydrodynamic lubrication
  90. 3-D Electromagnetic field analysis of wireless power transfer system using K computer
  91. Simplified simulation technique of rotating, induction heated, calender rolls for study of temperature field control
  92. Design, fabrication and testing of electroadhesive interdigital electrodes
  93. A method to reduce partial discharges in motor windings fed by PWM inverter
  94. Reluctance network lumped mechanical & thermal models for the modeling and predesign of concentrated flux synchronous machine
  95. Special Issue Applications of Nonlinear Dynamics
  96. Study on dynamic characteristics of silo-stock-foundation interaction system under seismic load
  97. Microblog topic evolution computing based on LDA algorithm
  98. Modeling the creep damage effect on the creep crack growth behavior of rotor steel
  99. Neighborhood condition for all fractional (g, f, n′, m)-critical deleted graphs
  100. Chinese open information extraction based on DBMCSS in the field of national information resources
  101. 10.1515/phys-2018-0079
  102. CPW-fed circularly-polarized antenna array with high front-to-back ratio and low-profile
  103. Intelligent Monitoring Network Construction based on the utilization of the Internet of things (IoT) in the Metallurgical Coking Process
  104. Temperature detection technology of power equipment based on Fiber Bragg Grating
  105. Research on a rotational speed control strategy of the mandrel in a rotary steering system
  106. Dynamic load balancing algorithm for large data flow in distributed complex networks
  107. Super-structured photonic crystal fiber Bragg grating biosensor image model based on sparse matrix
  108. Fractal-based techniques for physiological time series: An updated approach
  109. Analysis of the Imaging Characteristics of the KB and KBA X-ray Microscopes at Non-coaxial Grazing Incidence
  110. Application of modified culture Kalman filter in bearing fault diagnosis
  111. Exact solutions and conservation laws for the modified equal width-Burgers equation
  112. On topological properties of block shift and hierarchical hypercube networks
  113. Elastic properties and plane acoustic velocity of cubic Sr2CaMoO6 and Sr2CaWO6 from first-principles calculations
  114. A note on the transmission feasibility problem in networks
  115. Ontology learning algorithm using weak functions
  116. Diagnosis of the power frequency vacuum arc shape based on 2D-PIV
  117. Parametric simulation analysis and reliability of escalator truss
  118. A new algorithm for real economy benefit evaluation based on big data analysis
  119. Synergy analysis of agricultural economic cycle fluctuation based on ant colony algorithm
  120. Multi-level encryption algorithm for user-related information across social networks
  121. Multi-target tracking algorithm in intelligent transportation based on wireless sensor network
  122. Fast recognition method of moving video images based on BP neural networks
  123. Compressed sensing image restoration algorithm based on improved SURF operator
  124. Design of load optimal control algorithm for smart grid based on demand response in different scenarios
  125. Face recognition method based on GA-BP neural network algorithm
  126. Optimal path selection algorithm for mobile beacons in sensor network under non-dense distribution
  127. Localization and recognition algorithm for fuzzy anomaly data in big data networks
  128. Urban road traffic flow control under incidental congestion as a function of accident duration
  129. Optimization design of reconfiguration algorithm for high voltage power distribution network based on ant colony algorithm
  130. Feasibility simulation of aseismic structure design for long-span bridges
  131. Construction of renewable energy supply chain model based on LCA
  132. The tribological properties study of carbon fabric/ epoxy composites reinforced by nano-TiO2 and MWNTs
  133. A text-Image feature mapping algorithm based on transfer learning
  134. Fast recognition algorithm for static traffic sign information
  135. Topical Issue: Clean Energy: Materials, Processes and Energy Generation
  136. An investigation of the melting process of RT-35 filled circular thermal energy storage system
  137. Numerical analysis on the dynamic response of a plate-and-frame membrane humidifier for PEMFC vehicles under various operating conditions
  138. Energy converting layers for thin-film flexible photovoltaic structures
  139. Effect of convection heat transfer on thermal energy storage unit
https://doi.org/10.1515/phys-2018-0071
Keywords for this article
graph; data transmission network; all fractional factor; all fractional (g, f, n′, m)-critical deleted graph
Creative Commons
BY-NC-ND 4.0

Articles in the same Issue

  1. Regular Articles
  2. A modified Fermi-Walker derivative for inextensible flows of binormal spherical image
  3. Algebraic aspects of evolution partial differential equation arising in the study of constant elasticity of variance model from financial mathematics
  4. Three-dimensional atom localization via probe absorption in a cascade four-level atomic system
  5. Determination of the energy transitions and half-lives of Rubidium nuclei
  6. Three phase heat and mass transfer model for unsaturated soil freezing process: Part 1 - model development
  7. Three phase heat and mass transfer model for unsaturated soil freezing process: Part 2 - model validation
  8. Mathematical model for thermal and entropy analysis of thermal solar collectors by using Maxwell nanofluids with slip conditions, thermal radiation and variable thermal conductivity
  9. Constructing analytic solutions on the Tricomi equation
  10. Feynman diagrams and rooted maps
  11. New type of chaos synchronization in discrete-time systems: the F-M synchronization
  12. Unsteady flow of fractional Oldroyd-B fluids through rotating annulus
  13. A note on the uniqueness of 2D elastostatic problems formulated by different types of potential functions
  14. On the conservation laws and solutions of a (2+1) dimensional KdV-mKdV equation of mathematical physics
  15. Computational methods and traveling wave solutions for the fourth-order nonlinear Ablowitz-Kaup-Newell-Segur water wave dynamical equation via two methods and its applications
  16. Siewert solutions of transcendental equations, generalized Lambert functions and physical applications
  17. Numerical solution of mixed convection flow of an MHD Jeffery fluid over an exponentially stretching sheet in the presence of thermal radiation and chemical reaction
  18. A new three-dimensional chaotic flow with one stable equilibrium: dynamical properties and complexity analysis
  19. Dynamics of a dry-rebounding drop: observations, simulations, and modeling
  20. Modeling the initial mechanical response and yielding behavior of gelled crude oil
  21. Lie symmetry analysis and conservation laws for the time fractional simplified modified Kawahara equation
  22. Solitary wave solutions of two KdV-type equations
  23. Applying industrial tomography to control and optimization flow systems
  24. Reconstructing time series into a complex network to assess the evolution dynamics of the correlations among energy prices
  25. An optimal solution for software testing case generation based on particle swarm optimization
  26. Optimal system, nonlinear self-adjointness and conservation laws for generalized shallow water wave equation
  27. Alternative methods for solving nonlinear two-point boundary value problems
  28. Global model simulation of OH production in pulsed-DC atmospheric pressure helium-air plasma jets
  29. Experimental investigation on optical vortex tweezers for microbubble trapping
  30. Joint measurements of optical parameters by irradiance scintillation and angle-of-arrival fluctuations
  31. M-polynomials and topological indices of hex-derived networks
  32. Generalized convergence analysis of the fractional order systems
  33. Porous flow characteristics of solution-gas drive in tight oil reservoirs
  34. Complementary wave solutions for the long-short wave resonance model via the extended trial equation method and the generalized Kudryashov method
  35. A Note on Koide’s Doubly Special Parametrization of Quark Masses
  36. On right-angled spherical Artin monoid of type Dn
  37. Gas flow regimes judgement in nanoporous media by digital core analysis
  38. 4 + n-dimensional water and waves on four and eleven-dimensional manifolds
  39. Stabilization and Analytic Approximate Solutions of an Optimal Control Problem
  40. On the equations of electrodynamics in a flat or curved spacetime and a possible interaction energy
  41. New prediction method for transient productivity of fractured five-spot patterns in low permeability reservoirs at high water cut stages
  42. The collinear equilibrium points in the restricted three body problem with triaxial primaries
  43. Detection of the damage threshold of fused silica components and morphologies of repaired damage sites based on the beam deflection method
  44. On the bivariate spectral quasi-linearization method for solving the two-dimensional Bratu problem
  45. Ion acoustic quasi-soliton in an electron-positron-ion plasma with superthermal electrons and positrons
  46. Analysis of projectile motion in view of conformable derivative
  47. Computing multiple ABC index and multiple GA index of some grid graphs
  48. Terahertz pulse imaging: A novel denoising method by combing the ant colony algorithm with the compressive sensing
  49. Characteristics of microscopic pore-throat structure of tight oil reservoirs in Sichuan Basin measured by rate-controlled mercury injection
  50. An activity window model for social interaction structure on Twitter
  51. Transient thermal regime trough the constitutive matrix applied to asynchronous electrical machine using the cell method
  52. On the zagreb polynomials of benzenoid systems
  53. Integrability analysis of the partial differential equation describing the classical bond-pricing model of mathematical finance
  54. The Greek parameters of a continuous arithmetic Asian option pricing model via Laplace Adomian decomposition method
  55. Quantifying the global solar radiation received in Pietermaritzburg, KwaZulu-Natal to motivate the consumption of solar technologies
  56. Sturm-Liouville difference equations having Bessel and hydrogen atom potential type
  57. Study on the response characteristics of oil wells after deep profile control in low permeability fractured reservoirs
  58. Depiction and analysis of a modified theta shaped double negative metamaterial for satellite application
  59. An attempt to geometrize electromagnetism
  60. Structure of traveling wave solutions for some nonlinear models via modified mathematical method
  61. Thermo-convective instability in a rotating ferromagnetic fluid layer with temperature modulation
  62. Construction of new solitary wave solutions of generalized Zakharov-Kuznetsov-Benjamin-Bona-Mahony and simplified modified form of Camassa-Holm equations
  63. Effect of magnetic field and heat source on Upper-convected-maxwell fluid in a porous channel
  64. Physical cues of biomaterials guide stem cell fate of differentiation: The effect of elasticity of cell culture biomaterials
  65. Shooting method analysis in wire coating withdrawing from a bath of Oldroyd 8-constant fluid with temperature dependent viscosity
  66. Rank correlation between centrality metrics in complex networks: an empirical study
  67. Special Issue: The 18th International Symposium on Electromagnetic Fields in Mechatronics, Electrical and Electronic Engineering
  68. Modeling of electric and heat processes in spot resistance welding of cross-wire steel bars
  69. Dynamic characteristics of triaxial active control magnetic bearing with asymmetric structure
  70. Design optimization of an axial-field eddy-current magnetic coupling based on magneto-thermal analytical model
  71. Thermal constitutive matrix applied to asynchronous electrical machine using the cell method
  72. Temperature distribution around thin electroconductive layers created on composite textile substrates
  73. Model of the multipolar engine with decreased cogging torque by asymmetrical distribution of the magnets
  74. Analysis of spatial thermal field in a magnetic bearing
  75. Use of the mathematical model of the ignition system to analyze the spark discharge, including the destruction of spark plug electrodes
  76. Assessment of short/long term electric field strength measurements for a pilot district
  77. Simulation study and experimental results for detection and classification of the transient capacitor inrush current using discrete wavelet transform and artificial intelligence
  78. Magnetic transmission gear finite element simulation with iron pole hysteresis
  79. Pulsed excitation terahertz tomography – multiparametric approach
  80. Low and high frequency model of three phase transformer by frequency response analysis measurement
  81. Multivariable polynomial fitting of controlled single-phase nonlinear load of input current total harmonic distortion
  82. Optimal design of a for middle-low-speed maglev trains
  83. Eddy current modeling in linear and nonlinear multifilamentary composite materials
  84. The visual attention saliency map for movie retrospection
  85. AC/DC current ratio in a current superimposition variable flux reluctance machine
  86. Influence of material uncertainties on the RLC parameters of wound inductors modeled using the finite element method
  87. Cogging force reduction in linear tubular flux switching permanent-magnet machines
  88. Modeling hysteresis curves of La(FeCoSi)13 compound near the transition point with the GRUCAD model
  89. Electro-magneto-hydrodynamic lubrication
  90. 3-D Electromagnetic field analysis of wireless power transfer system using K computer
  91. Simplified simulation technique of rotating, induction heated, calender rolls for study of temperature field control
  92. Design, fabrication and testing of electroadhesive interdigital electrodes
  93. A method to reduce partial discharges in motor windings fed by PWM inverter
  94. Reluctance network lumped mechanical & thermal models for the modeling and predesign of concentrated flux synchronous machine
  95. Special Issue Applications of Nonlinear Dynamics
  96. Study on dynamic characteristics of silo-stock-foundation interaction system under seismic load
  97. Microblog topic evolution computing based on LDA algorithm
  98. Modeling the creep damage effect on the creep crack growth behavior of rotor steel
  99. Neighborhood condition for all fractional (g, f, n′, m)-critical deleted graphs
  100. Chinese open information extraction based on DBMCSS in the field of national information resources
  101. 10.1515/phys-2018-0079
  102. CPW-fed circularly-polarized antenna array with high front-to-back ratio and low-profile
  103. Intelligent Monitoring Network Construction based on the utilization of the Internet of things (IoT) in the Metallurgical Coking Process
  104. Temperature detection technology of power equipment based on Fiber Bragg Grating
  105. Research on a rotational speed control strategy of the mandrel in a rotary steering system
  106. Dynamic load balancing algorithm for large data flow in distributed complex networks
  107. Super-structured photonic crystal fiber Bragg grating biosensor image model based on sparse matrix
  108. Fractal-based techniques for physiological time series: An updated approach
  109. Analysis of the Imaging Characteristics of the KB and KBA X-ray Microscopes at Non-coaxial Grazing Incidence
  110. Application of modified culture Kalman filter in bearing fault diagnosis
  111. Exact solutions and conservation laws for the modified equal width-Burgers equation
  112. On topological properties of block shift and hierarchical hypercube networks
  113. Elastic properties and plane acoustic velocity of cubic Sr2CaMoO6 and Sr2CaWO6 from first-principles calculations
  114. A note on the transmission feasibility problem in networks
  115. Ontology learning algorithm using weak functions
  116. Diagnosis of the power frequency vacuum arc shape based on 2D-PIV
  117. Parametric simulation analysis and reliability of escalator truss
  118. A new algorithm for real economy benefit evaluation based on big data analysis
  119. Synergy analysis of agricultural economic cycle fluctuation based on ant colony algorithm
  120. Multi-level encryption algorithm for user-related information across social networks
  121. Multi-target tracking algorithm in intelligent transportation based on wireless sensor network
  122. Fast recognition method of moving video images based on BP neural networks
  123. Compressed sensing image restoration algorithm based on improved SURF operator
  124. Design of load optimal control algorithm for smart grid based on demand response in different scenarios
  125. Face recognition method based on GA-BP neural network algorithm
  126. Optimal path selection algorithm for mobile beacons in sensor network under non-dense distribution
  127. Localization and recognition algorithm for fuzzy anomaly data in big data networks
  128. Urban road traffic flow control under incidental congestion as a function of accident duration
  129. Optimization design of reconfiguration algorithm for high voltage power distribution network based on ant colony algorithm
  130. Feasibility simulation of aseismic structure design for long-span bridges
  131. Construction of renewable energy supply chain model based on LCA
  132. The tribological properties study of carbon fabric/ epoxy composites reinforced by nano-TiO2 and MWNTs
  133. A text-Image feature mapping algorithm based on transfer learning
  134. Fast recognition algorithm for static traffic sign information
  135. Topical Issue: Clean Energy: Materials, Processes and Energy Generation
  136. An investigation of the melting process of RT-35 filled circular thermal energy storage system
  137. Numerical analysis on the dynamic response of a plate-and-frame membrane humidifier for PEMFC vehicles under various operating conditions
  138. Energy converting layers for thin-film flexible photovoltaic structures
  139. Effect of convection heat transfer on thermal energy storage unit
Sign up now to receive a 20% welcome discount
Institutional Access
How does access work?
Have an idea on how to improve our website?
Please write us.
© 2025 De Gruyter Brill
Downloaded on 22.10.2025 from https://www.degruyterbrill.com/document/doi/10.1515/phys-2018-0071/html
Scroll to top button