Zhangdong Ouyang

According to our database, Zhangdong Ouyang authored at least 22 papers between 2009 and 2025.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2025

The generalized 4-connectivity of burnt pancake graphs.

Jing Wang, Jiang Wu, Zhangdong Ouyang, Yuanqiu Huang

Discret. Appl. Math., 2025

2022

On the Size of Matchings in 1-Planar Graph with High Minimum Degree.

Yuanqiu Huang, Zhangdong Ouyang, Fengming Dong

SIAM J. Discret. Math., December, 2022

New upper bounds for the crossing numbers of crossing-critical graphs.

Zongpeng Ding, Zhangdong Ouyang, Yuanqiu Huang, Fengming Dong

Discret. Math., 2022

Express the number of spanning trees in term of degrees.

Fengming Dong, Jun Ge, Zhangdong Ouyang

Appl. Math. Comput., 2022

2021

Zip product of graphs and crossing numbers.

Zhangdong Ouyang, Yuanqiu Huang, Fengming Dong, Eng Guan Tay

J. Graph Theory, 2021

Proving a conjecture on chromatic polynomials by counting the number of acyclic orientations.

Fengming Dong, Jun Ge, Helin Gong, Bo Ning, Zhangdong Ouyang, Eng Guan Tay

J. Graph Theory, 2021

The Maximal 1-Planarity and Crossing Numbers of Graphs.

Zhangdong Ouyang, Yuanqiu Huang, Fengming Dong

Graphs Comb., 2021

On the Sizes of Bipartite 1-Planar Graphs.

Yuanqiu Huang, Zhangdong Ouyang, Fengming Dong

Electron. J. Comb., 2021

2019

The crossing number of the hexagonal graph <i>H_{3, n}</i>.

Yuanqiu Huang, Zhangdong Ouyang, Jing Wang

Discuss. Math. Graph Theory, 2019

On the skewness of Cartesian products with trees.

Zhangdong Ouyang, Fengming Dong, Eng Guan Tay

Discret. Appl. Math., 2019

Remarks on the joins of 1-planar graphs.

Zhangdong Ouyang, Jun Ge, Yichao Chen

Appl. Math. Comput., 2019

2018

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

Yuanqiu Huang, Zhangdong Ouyang, Jing Wang

Discuss. Math. Graph Theory, 2018

The Strong Product of Graphs and Crossing Numbers.

Zhangdong Ouyang, Jing Wang, Yuanqiu Huang

Ars Comb., 2018

The crossing numbers of Cartesian products of path with some graphs.

Zongpeng Ding, Yuanqiu Huang, Zhangdong Ouyang

Ars Comb., 2018

k -Coverage Estimation Problem in Heterogeneous Camera Sensor Networks With Boundary Deployment.

Zhimin Liu, Zhangdong Ouyang

IEEE Access, 2018

2017

A Learning Automata-based Algorithm for Area Coverage Problem in Directional Sensor Networks.

Zhimin Liu, Zhangdong Ouyang

KSII Trans. Internet Inf. Syst., 2017

2016

Total Embedding distributions for two graph families obtained from the dipole D₃.

Ting Guo, Yuanqiu Huang, Zhangdong Ouyang

Ars Comb., 2016

2015

The Second-minimum Gutman Index of The Unicyclic Graphs With Given Girth.

Yahui Hu, Yaoping Hou, Zhangdong Ouyang

Ars Comb., 2015

2014

The crossing number of the Cartesian product of paths with complete graphs.

Zhangdong Ouyang, Jing Wang, Yuanqiu Huang

Discret. Math., 2014

2013

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

Zhangdong Ouyang, Jing Wang, Yuanqiu Huang

Ars Comb., 2013

2010

On the lower bounds for the maximum genus for simple graphs.

Zhangdong Ouyang, Jing Wang, Yuanqiu Huang

Eur. J. Comb., 2010

2009

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

Zhangdong Ouyang, Jing Wang, Yuanqiu Huang

Graphs Comb., 2009