Zhangdong Ouyang

Orcid: 0000-0003-1559-8909

According to our database1, Zhangdong Ouyang authored at least 21 papers between 2009 and 2022.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2022
On the Size of Matchings in 1-Planar Graph with High Minimum Degree.
SIAM J. Discret. Math., December, 2022

New upper bounds for the crossing numbers of crossing-critical graphs.
Discret. Math., 2022

Express the number of spanning trees in term of degrees.
Appl. Math. Comput., 2022

2021
Zip product of graphs and crossing numbers.
J. Graph Theory, 2021

Proving a conjecture on chromatic polynomials by counting the number of acyclic orientations.
J. Graph Theory, 2021

The Maximal 1-Planarity and Crossing Numbers of Graphs.
Graphs Comb., 2021

On the Sizes of Bipartite 1-Planar Graphs.
Electron. J. Comb., 2021

2019
The crossing number of the hexagonal graph <i>H<sub>3, n</sub></i>.
Discuss. Math. Graph Theory, 2019

On the skewness of Cartesian products with trees.
Discret. Appl. Math., 2019

Remarks on the joins of 1-planar graphs.
Appl. Math. Comput., 2019

2018
The crossing number of join of the generalized Petersen graph <i>P</i>(3, 1) with path and cycle.
Discuss. Math. Graph Theory, 2018

The Strong Product of Graphs and Crossing Numbers.
Ars Comb., 2018

The crossing numbers of Cartesian products of path with some graphs.
Ars Comb., 2018

k -Coverage Estimation Problem in Heterogeneous Camera Sensor Networks With Boundary Deployment.
IEEE Access, 2018

2017
A Learning Automata-based Algorithm for Area Coverage Problem in Directional Sensor Networks.
KSII Trans. Internet Inf. Syst., 2017

2016
Total Embedding distributions for two graph families obtained from the dipole D<sub>3</sub>.
Ars Comb., 2016

2015
The Second-minimum Gutman Index of The Unicyclic Graphs With Given Girth.
Ars Comb., 2015

2014
The crossing number of the Cartesian product of paths with complete graphs.
Discret. Math., 2014

2013
The Degree-Sum of Adjacent Vertices, Girth and Upper Embeddability.
Ars Comb., 2013

2010
On the lower bounds for the maximum genus for simple graphs.
Eur. J. Comb., 2010

2009
Upper Embeddability, Girth and the Degree-Sum of Nonadjacent Vertices.
Graphs Comb., 2009


  Loading...