中文
Home
Scientific Research
Research Field
Paper Publications
Patents
Published Books
Research Projects
Teaching Research
Teaching Resources
Teaching Information
Teaching Achievement
Awards and Honours
Enrollment Information
Student Information
My Album
Blog
Paper Publications
[1]Weihua He, Hao Li*, Qiang Sun, Locating any two vertices on Hamiltonian cycles in large graphs. Discrete Mathematics, 2020, 343(9), 111941.
[2]WeiHua He, Hao Li*, Qiang Sun. Distributing pairs of vertices on Hamiltonian cycles. Science China Mathematics, 2018, 61(5): 955-972.
[3]Weihua He*, Weihua Yang. Hamiltonian paths in spanning subgraphs of line graphs. Discrete Mathematics, 2017, 340(6): 1359-1366.
[4]Hao Li, Weihua He*, Weihua Yang, Yandong Bai. Hamiltonian cycles in spanning subgraphs of line graphs. Discrete Applied Mathematics, 2016, 209: 287-295.
[5]Junlin Huang, Guixian Huang, Jianping Li, Weihua He*, On the minimum Kirchhoff index of graphs with a given number of cut vertices, Discrete Applied Mathematics, 2025, 365:7-38.
[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]Qiqi Huang, Werihua He*, Chaoqin Zhang. Graphs with Positive Ricci Curvature. Graphs and Combinatorics, 2025, 41(1): 14..
[8]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..
[9]Weihua He, Ziwen Liu, Chao Yang*. Snowman is PSPACE -complete. Theoretical Computer Science, 2017, 677: 31-40.
[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, Yandong Bai, Qiang Sun. Linear arboricity of regular digraphs. Acta Mathematica Sinica, English Series, 2017, 33(4): 501-508.
[12]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.
[13]Hao Li, Yandong Bai*, Weihua He, Qiang Sun. Vertex-distinguishing proper arc colorings of digraphs. Discrete Applied Mathematics, 2016, 209: 276-286.
[14]Yandong Bai*, Binlong Li, Hao Li,, Weihua He. Universal arcs in tournaments. Discrete Mathematics, 2016, 339(8): 2063-2065.
[15]Yandong Bai*, Hao Li, Weihua He. Complementary cycles in regular bipartite tournaments. Discrete Mathematics, 2014, 333: 14-27.
[16]Rui Chen, Jianping Li, Weihua He* , Assessing Graph Robustness through Modified Zagreb Index, Axioms 2022, 11(9), 484..
[17]Xiaoling Zhou, Chao Yang, Weihua He* , The linear k-arboricity of digraphs, AIMS Mathematics, 2022, 7(3): 4137-4152..
[18]Xiaoling Zhou, Chao Yang, Weihua He* , The linear k-arboricity of symmetric directed trees, AIMS Mathematics, 2022, 7(2): 1603-1614..
[19]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.
[20]Xiaodi Song, Jianping Li*, Weihua He, On Zagreb eccentricity indices of cacti. Applied Mathematics and Computation, 2020, 383:125361.
[21]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.
[22]Weihua Yang*, Weihua He, Hao Li, Xingchao Deng. Supereulerian graphs and Chvátal-Erdös type conditions. Ars Combin., 132 (2017), 183–192.
[23]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.
[24]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.
total24 1/1
first
previous
next
last
何伟骅
384
Email:hwh12@gdut.edu.cn
Guangdong University of Technology Tel:020-39323866
Copyright @ 2020-2021 All rights reserved. Guangdong ICP No. 05008833
Click:
MOBILE Version
The Last Update Time:
.
.