Zhangdong Ouyang

23 papers Journal 23
YearRankTypeTitle / Venue / Authors
2025 J jnl
Reliability analysis of godan graphs in terms of generalized 4-connectivity.
Discret. Appl. Math.
Jing Wang, Zhangdong Ouyang, Yuanqiu Huang
2025 J jnl
The generalized 4-connectivity of burnt pancake graphs.
Discret. Appl. Math.
Jing Wang, Jiang Wu, Zhangdong Ouyang, Yuanqiu Huang
2022 J jnl
Express the number of spanning trees in term of degrees.
Appl. Math. Comput.
Fengming Dong, Jun Ge, Zhangdong Ouyang
2022 J jnl
New upper bounds for the crossing numbers of crossing-critical graphs.
Discret. Math.
Zongpeng Ding, Zhangdong Ouyang, Yuanqiu Huang, Fengming Dong
2022 J jnl
On the Size of Matchings in 1-Planar Graph with High Minimum Degree.
SIAM J. Discret. Math.
Yuanqiu Huang, Zhangdong Ouyang, Fengming Dong
2021 J jnl
On the Sizes of Bipartite 1-Planar Graphs.
Electron. J. Comb.
Yuanqiu Huang, Zhangdong Ouyang, Fengming Dong
2021 J jnl
Proving a conjecture on chromatic polynomials by counting the number of acyclic orientations.
J. Graph Theory
Fengming Dong, Jun Ge, Helin Gong, Bo Ning, Zhangdong Ouyang, Eng Guan Tay
2021 J jnl
The Maximal 1-Planarity and Crossing Numbers of Graphs.
Graphs Comb.
Zhangdong Ouyang, Yuanqiu Huang, Fengming Dong
2021 J jnl
Zip product of graphs and crossing numbers.
J. Graph Theory
Zhangdong Ouyang, Yuanqiu Huang, Fengming Dong, Eng Guan Tay
2019 J jnl
On the skewness of Cartesian products with trees.
Discret. Appl. Math.
Zhangdong Ouyang, Fengming Dong, Eng Guan Tay
2019 J jnl
Remarks on the joins of 1-planar graphs.
Appl. Math. Comput.
Zhangdong Ouyang, Jun Ge, Yichao Chen
2019 J jnl
The crossing number of the hexagonal graph
Discuss. Math. Graph Theory
Yuanqiu Huang, Zhangdong Ouyang, Jing Wang
2018 J jnl
The Strong Product of Graphs and Crossing Numbers.
Ars Comb.
Zhangdong Ouyang, Jing Wang, Yuanqiu Huang
2018 J jnl
The crossing number of join of the generalized Petersen graph
Discuss. Math. Graph Theory
Yuanqiu Huang, Zhangdong Ouyang, Jing Wang
2018 J jnl
The crossing numbers of Cartesian products of path with some graphs.
Ars Comb.
Zongpeng Ding, Yuanqiu Huang, Zhangdong Ouyang
2018 J jnl
k -Coverage Estimation Problem in Heterogeneous Camera Sensor Networks With Boundary Deployment.
IEEE Access
Zhimin Liu, Zhangdong Ouyang
2017 J jnl
A Learning Automata-based Algorithm for Area Coverage Problem in Directional Sensor Networks.
KSII Trans. Internet Inf. Syst.
Zhimin Liu, Zhangdong Ouyang
2016 J jnl
Total Embedding distributions for two graph families obtained from the dipole D
Ars Comb.
Ting Guo, Yuanqiu Huang, Zhangdong Ouyang
2015 J jnl
The Second-minimum Gutman Index of The Unicyclic Graphs With Given Girth.
Ars Comb.
Yahui Hu, Yaoping Hou, Zhangdong Ouyang
2014 J jnl
The crossing number of the Cartesian product of paths with complete graphs.
Discret. Math.
Zhangdong Ouyang, Jing Wang, Yuanqiu Huang
2013 J jnl
The Degree-Sum of Adjacent Vertices, Girth and Upper Embeddability.
Ars Comb.
Zhangdong Ouyang, Jing Wang, Yuanqiu Huang
2010 J jnl
On the lower bounds for the maximum genus for simple graphs.
Eur. J. Comb.
Zhangdong Ouyang, Jing Wang, Yuanqiu Huang
2009 J jnl
Upper Embeddability, Girth and the Degree-Sum of Nonadjacent Vertices.
Graphs Comb.
Zhangdong Ouyang, Jing Wang, Yuanqiu Huang