#### Filter Results:

- Full text PDF available (26)

#### Publication Year

2000

2018

- This year (6)
- Last 5 years (21)
- Last 10 years (42)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn 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â€¦ (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â€¦ (More)

- Xinyu Wang, Jishen Zhang, +4 authors Yiyun Cheng
- Biomaterials
- 2016

Photothermal-chemotherapy (PT-CT) is a promising strategy for cancer treatment, but its development is hindered by the issues regarding to the long-term safety of carriers and imperfect drug releaseâ€¦ (More)

- Anthony Bonato, Noor Hadi, Paul Horn, Pawel Pralat, Changping Wang
- ArXiv
- 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â€¦ (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 âˆˆâ€¦ (More)

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

- 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

- Changping Wang
- Graphs and Combinatorics
- 2013

A signed k-submatching of a graph G is a function f : E(G) â†’ {âˆ’1, 1} satisfying f (EG(v)) â‰¤ 1 for at least k vertices v âˆˆ V (G). The maximum of the values of f (E(G)) , taken over all signedâ€¦ (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â€¦ (More)

Positive solution of fourth order ordinary differential equation with four-point boundary conditions

- 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)âˆ’â€¦ (More)