Paper Publications
- [1]Rui Chen, Jianping Li, Weihua He* , Assessing Graph Robustness through Modified Zagreb Index, Axioms 2022, 11(9), 484..
- [2]Xiaoling Zhou, Chao Yang, Weihua He* , The linear k-arboricity of digraphs, AIMS Mathematics, 2022, 7(3): 4137-4152..
- [3]Xiaoling Zhou, Chao Yang, Weihua He* , The linear k-arboricity of symmetric directed trees, AIMS Mathematics, 2022, 7(2): 1603-1614..
- [4]Weihua He, Jun Luo, Wei Yuan, Chao Yang*, Huichun Zhang, Ricci-flat graphs with girth four, Acta Mathematica Sinica, English Series, 2021, 37 (11): 1679-1691..
- [5]Weihua He, Hao Li*, Qiang Sun, Locating any two vertices on Hamiltonian cycles in large graphs. Discrete Mathematics, 2020, 343(9), 111941.
- [6]Xiaojing Jiang, Weihua He*, Qiang Liu, Jianping Li. On the Kirchhoff index of bipartite graphs with given diameters. Discrete Applied Mathematics, 2020, 283, 512-521.
- [7]Yufei Huang, Weihua He, Guangxian Huang, Hong-Jian Lai*, Sulin Song. A characterization of graphs with supereulerian line graphs. International Journal of Computer Mathematics: Computer Systems Theory, 5(1) 2020, 1-14.
- [8]Xiaodi Song, Jianping Li*, Weihua He, On Zagreb eccentricity indices of cacti. Applied Mathematics and Computation, 2020, 383:125361.
- [9]Guixian Huang, Weihua He*, Yuanyao Tan. Theoretical and computational methods to minimize Kirchhoff index of graphs with a given edge k-partiteness. Applied Mathematics and Computation, 341 (2019) 348–357.
- [10]Chengfu Qin*, Weihua He, Kiyoshi Ando. A constructive characterization of contraction critical 8-connected graphs with minimum degree 9. Discrete Mathematics, 2019, 342(11): 3047-3056.
- [11]WeiHua He, Hao Li*, Qiang Sun. Distributing pairs of vertices on Hamiltonian cycles. Science China Mathematics, 2018, 61(5): 955-972.
- [12]Weihua He*, Hao Li, Yandong Bai, Qiang Sun. Linear arboricity of regular digraphs. Acta Mathematica Sinica, English Series, 2017, 33(4): 501-508.
- [13]Weihua Yang*, Weihua He, Hao Li, Xingchao Deng. Supereulerian graphs and Chvátal-Erdös type conditions. Ars Combin., 132 (2017), 183–192.
- [14]Weihua He, Ziwen Liu, Chao Yang*. Snowman is PSPACE -complete. Theoretical Computer Science, 2017, 677: 31-40.
- [15]Weihua He*, Weihua Yang. Hamiltonian paths in spanning subgraphs of line graphs. Discrete Mathematics, 2017, 340(6): 1359-1366.
- [16]Weihua He, Hao Li*, Shuofa Xiao. On the minimum Kirchhoff index of graphs with a given vertex k -partiteness and edge k -partiteness. Applied Mathematics and Computation, 2017, 315: 313-318.
- [17]Hao Li, Yandong Bai, Weihua He*, Qiang Sun. Vertex-distinguishing proper arc colorings of digraphs. Discrete Applied Mathematics, 2016, 209: 276-286.
- [18]Hao Li, Weihua He*, Weihua Yang, Yandong Bai. Hamiltonian cycles in spanning subgraphs of line graphs. Discrete Applied Mathematics, 2016, 209: 287-295.
- [19]Hao Li, Weihua He*, Weihua Yang, Yandong Bai. A Note on Edge-Disjoint Hamilton Cycles in Line Graphs. Graphs and Combinatorics, 2016, 32(2): 741-744.
- [20]Yandong Bai*, Binlong Li, Hao Li,, Weihua He. Universal arcs in tournaments. Discrete Mathematics, 2016, 339(8): 2063-2065.
- [21]Weihua Yang*, Hengzhe Li, Weihua He. Edge-fault-tolerant bipancyclicity of Cayley graphs generated by transposition-generating trees. International Journal of Computer Mathematics, 2015, 92(7): 1345-1352.
- [22]Yandong Bai*, Hao Li, Weihua He. Complementary cycles in regular bipartite tournaments. Discrete Mathematics, 2014, 333: 14-27.
total22 1/1 |
first
previous
next
last
|
|
|
- 何伟骅
|