#### Filter Results:

- Full text PDF available (25)

#### Publication Year

2000

2017

- This year (2)
- Last 5 years (18)
- Last 10 years (41)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Anthony Bonato, Noor Hadi, Paul Horn, Pawel Pralat, Changping Wang
- WAW
- 2009

We present a deterministic model for on-line social networks based on transitivity and local knowledge in social interactions. In the Iterated Local Transitivity (ILT) model, at each time-step and for every existing node x, a new node appears which joins to the closed neighbour set of x. The ILT model provably satisfies a number of both local and global… (More)

- Changping Wang
- Australasian J. Combinatorics
- 2008

A bad function is a function f : V (G) → {−1, 1} satisfying ∑ v∈N(v) f(v) ≤ 1 for every v ∈ V (G), where N(v) = {u ∈ V (G) | uv ∈ E(G)}. The maximum of the values of ∑ v∈V (G) f(v), taken over all bad functions f, is called the negative decision number and is denoted by βD(G). In this paper, several sharp upper bounds of this number for general graphs are… (More)

- Anthony Bonato, Gena Hahn, Changping Wang
- Contributions to Discrete Mathematics
- 2007

We consider the game of Cops and Robber played with infinitely many cops on countable graphs. We give a sufficient condition— the strongly 1-e.c. property—for the cop number to be infinite. The cop density of a finite graph, defined as the ratio of the cop number and the number of vertices, is investigated. In the infinite case, the limits of the cop… (More)

- Shihua Chen, Wei Ni, Changping Wang
- Appl. Math. Lett.
- 2006

In this work, the authors consider the fourth order nonlinear ordinary differential equation u(4)(t) = f (t, u(t)), 0 < t < 1, with the four-point boundary conditions u(0) = u(1) = 0, au′′(ξ1)− bu′′′(ξ1) = 0, cu′′(ξ2)+ du′′′(ξ2) = 0, where 0 ≤ ξ1 < ξ2 ≤ 1. By means of the upper and lower solution method and fixed point theorems, some results on the… (More)

- Anthony Bonato, Noor Hadi, Paul Horn, P. Pra÷at, Changping Wang, Changping Wang
- 2009

We present a deterministic model for on-line social networks (OSNs) based on transitivity and local knowledge in social interactions. In the Iterated Local Transitivity (ILT) model, at each time-step and for every existing node x, a new node appears which joins to the closed neighbour set of x. The ILT model provably satisfies a number of both local and… (More)

- Anthony Bonato, Changping Wang
- Discussiones Mathematicae Graph Theory
- 2008

Domination parameters in random graphs G(n, p), where p is a fixed real number in (0, 1), are investigated. We show that with probability tending to 1 as n → ∞, the total and independent domination numbers concentrate on the domination number of G(n, p).

- Dejan Delic, Changping Wang
- Inf. Process. Lett.
- 2010

Article history: Received 27 November 2009 Received in revised form 30 April 2010 Accepted 21 May 2010 Available online 25 May 2010 Communicated by S.E. Hambrusch

- Shihua Chen, Ja Hu, Changping Wang, Jinhu Lü
- 2004

In this Letter, an approach of adaptive synchronization and parameters identification of uncertain Rössler hyperchaotic system is proposed. The suggested tool proves to be globally and asymptotically stable by means of Lyapunov method. With this new and effective method, parameters identification and synchronization of Rössler hyperchaotic with all the… (More)

- Anthony Bonato, Pawel Pralat, Changping Wang
- Internet Mathematics
- 2007

Vertex pursuit games, such as the game of Cops and Robbers, are a simplified model for network security. In these games, cops try to capture a robber loose on the vertices of the network. The minimum number of cops required to win on a graph G is the cop number of G. We present asymptotic results for the game of Cops and Robbers played in various stochastic… (More)

- Changping Wang
- Ars Comb.
- 2012

For any integer k ≥ 1, a signed (total) k-dominating function is a function f : V (G) → {−1, 1} satisfying w∈N [v] f(w) ≥ k ( P w∈N(v) f(w) ≥ k) for every v ∈ V (G), where N(v) = {u ∈ V (G)|uv ∈ E(G)} and N [v] = N(v)∪{v}. The minimum of the values ofv∈V (G) f(v), taken over all signed (total) k-dominating functions f, is called the signed (total)… (More)