Jianping Ou

According to our database1, Jianping Ou authored at least 20 papers between 2004 and 2017.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2017
A novel motion compensation method for random frequency hopping radar.
Proceedings of the 10th International Congress on Image and Signal Processing, 2017

2015
On restricted edge connectivity of strong product graphs.
Ars Comb., 2015

2014
On Minimum Wiener Polarity Index of Unicyclic Graphs with Prescribed Maximum Degree.
J. Applied Mathematics, 2014

On restricted edge-connectivity of lexicographic product graphs.
Int. J. Comput. Math., 2014

A 3D pointcloud registration algorithm based on fast coherent point drift.
Proceedings of the 2014 IEEE Applied Imagery Pattern Recognition Workshop, 2014

2013
On m-restricted edge connectivity of undirected generalized De Bruijn graphs.
Int. J. Comput. Math., 2013

On Edge Cut of Graphs Leaving Components of Order at Least Five.
Graphs and Combinatorics, 2013

On equality of restricted edge connectivity and minimum edge degree of graphs.
Ars Comb., 2013

2012
On Arc Connectivity of Direct-Product Digraphs.
J. Applied Mathematics, 2012

Sufficient conditions for maximally restricted edge connected graphs.
Discrete Mathematics, 2012

On 3-restricted edge connectivity of Cartesian product graphs.
Ars Comb., 2012

2011
On optimizing edge connectivity of product graphs.
Discrete Mathematics, 2011

2010
On maximal 3-restricted edge connectivity of regular graphs.
Int. J. Comput. Math., 2010

Acyclic molecules with second maximal energy.
Appl. Math. Lett., 2010

On maximal 3-restricted edge connectivity and reliability analysis of hypercube networks.
Applied Mathematics and Computation, 2010

On restricted edge connectivity of regular Cartesian product graphs.
Australasian J. Combinatorics, 2010

2009
On 3-restricted edge connectivity of undirected binary Kautz graphs.
Discrete Mathematics, 2009

On extremal unicyclic molecular graphs with maximal Hosoya index.
Discrete Applied Mathematics, 2009

2005
Edge cuts leaving components of order at least m.
Discrete Mathematics, 2005

2004
4-restricted edge cuts of graphs.
Australasian J. Combinatorics, 2004


  Loading...