一  基本信息

杨卫华，教授、博士生导师，院长；

邮箱：yangweihua@tyut.edu.cn

二  个人经历

2019.12- 今 44118太阳成城集团 教授

2014.8-2019.12 44118太阳成城集团 副教授

2012.12-2014.7 44118太阳成城集团 讲师

三  研究方向、教学课程

研究方向：

1. 图论

2. 人工智能

主讲课程：

线性代数、组合数学、图论、控制论基础等

四 科研成果、教学成果

在JGT、SIAM DM、DM等发表论文130余篇；已主持国家自然科学基金4项；主持省级线上课程1门。(主要论文参见https: //dblp.org/pid/68/3781.html，https://www.researchgate.net/profile/Weihua-Yang-2)

1. H. Ma, W. Yang, On the minimum degree of minimally t-tough, claw-free graphs, Journal of Graph Theory, accepted，2025.

2. J. Fan, X. Hu, W. Yang, S. Zhao: On vertices of outdegree k in minimally k-arc-connected digraphs. Discret. Appl. Math. 361: 465-472 (2025)

3. X. Li, W. Yang, B. Zhang, S. Zhao: On regular 2-path Hamiltonian graphs. Discret. Appl. Math. 365: 61-70 (2025)

4. X. Guan, W. Yang, On the Pagenumber of 1-Planar Graphs, Chin. Ann. Math. Ser. B 46(2), 2025, 287–302 DOI: 10.1007/s11401-025-0016-1

5. Y. Xin, W. Yang, Decomposition of the line graph of the complete graph into stars, Discrete Mathematics (2024) 114026.

6. S. Ren, J. Wang, S. Wang, Weihua Yang, A stability result for C2k+1-free graphs, SIAM Journal on Discrete Mathematics 38 (2024) 1733-1756.

7. H. Ma, X. Hu, W. Yang, The structure of minimally t-tough, 2K2-free graphs, Discrete Applied Mathematics 346 (2024) 1-9

8. J. Wang, S. Wang, W. Yang, Counterexamples to Gerbner’s Conjecture on Stability of Maximal F -free Graphs, Journal of Graph Theory 105 (2024) 260-284.

9. X. Li, W. Yang, On regular 2-connected 2-path Hamiltonian graphs, Discrete Mathematics, 346 (2023) 113468.

10. H. Ma, X. Hu and W. Yang, On the minimum degree of minimally 1-tough, triangle-free graphs and minimally 3/2-tough, claw-free graphs, Discrete Mathematics, 346 (2023) 113352.

11. J. Wang, S. Wang, W. Yang, X. Yuan: A stability theorem for maximal ${C}_{2k+1}$ -free graphs. J. Graph Theory 101(2): 274-287 (2022)

12. J. Wu , L. Wang , Weihua Yang, Learning to compute the metric dimension of graphs, Applied Mathematics and Computation 432 (2022) 127350.

13. X. Yuan, Weihua Yang, On Generalized Turán Number of Two Disjoint Cliques, Graphs and Combinatorics 38(4): 116 (2022).

14. L. Chen, S. Lin, H. Huang, W. Yang, Charging Path Optimization in Mobile Networks, IEEE/ACM Transactions on Networking 30(2022) 2262-2273.

15. J. Wang, S. Wang, X. Yuan, W. Yang, A stability theorem for maximal C_{2k+1}‐free graphs, Journal of Graph Theory 101(2): 274-287 (2022).

16. Y. Kou, W. Yang, The clique distribution in powers of hypercubes. Discret. Appl. Math. 305: 76-85 (2021).

17. S. Zhao, Z. Chen, W. Yang, J. Meng，Edge fault-tolerance analysis of maximally edge-connected graphs and super edge-connected graphs. J. Comput. Syst. Sci. 115: 64-72 (2021).

18. X. Zhou, W. Yang, X. Guan and C. Qin，A characterization of internally 4-connected {P10−{v1,v2}}-minor-free graphs，Discussiones Mathematicae Graph Theory，https://doi.org/10.7151/ dmgt. 2404，2021.

19. X. Duan, B. Ning, X. Peng, J. Wang, W. Yang: Maximizing the number of cliques in graphs with given matching number. Discret. Appl. Math. 287: 110-117 (2020).

20. X. Guan，W. Yang, Embedding 5-planar graphs in three pages, Discrete Applied Mathematics 282: 108-121 (2020).

21. X. Guan, R-H. Li, S. Zhang, L. Chen, Weihua Yang, Anti-k-labeling of graphs, Applied Mathematics and Computation. 363（2019） 124549.

22. J. Wang, W. Yang, The Turan number for Spanning Linear Forests, Discrete Applied Mathematics 254 (2019) 291-294.

23. X. Guan, L. Xue, E. Cheng, W. Yang, Minimum degree and size conditions for the proper connection number of graphs. Applied Mathematics and Computation 352 (2019) 205-210.

24. S. Zhao, W. Yang, Conditional connectivity of folded hypercubes, Discrete Applied Mathematics 255（2019）388-392.

25. L. Xue, W. Yang, S. Zhang, Number of proper paths in edge-colored hypercubes，Applied Mathematics and Computation, 332 (2018) 420-424.

26. B. Zhang, W. Yang, On the spanning connectivity of tournaments, Discrete Applied Mathematics, 239 (2018) 218–222.

27. W. Yang, A kind of conditional connectivity of transposition networks generated by k-tree, Discrete Applied Mathematics, 237(2018) 132-138.

28. H. Lin, W. Yang, A conditional edge connectivity of double-orbit networks, Future Generation Computer Systems, 83 (2018) 445-449.

29. W. He, W. Yang, Hamiltonian paths in spanning subgraphs of line graphs. Discrete Mathematics 340(6): 1359-1366 (2017).

30. S. Zhang, L. Chen, W. Yang, On fault-tolerant path optimization under QoS constraint in multi-channel wireless networks. Theoretical Computer Science 695 (2017) 74-82.

31. W. Yang，W. He, H. Li, X. Deng, Supereulerian graphs and Chvatal-Erdos type conditions, Ars Combinatoria 132 (2017) 183-192. (SCI)

32. Hao Li , W. He, W. Yang, Y. Bai，A Note on Edge-Disjoint Hamilton Cycles in Line Graph，Graphs and Combinatorics 32 (2016) 741-744

33. Hao Li , W. He, W. Yang, Y. Bai， Hamiltonian cycles in spanning subgraphs of line graphs，Discrete Applied Mathematics 209 (2016) 287-295.

34. W. Yang, C. Qin, M. Chen, On cyclic edge-connectivity and super cyclic edge-connectivity, Bulletin of the Malaysian Mathematical Sciences Society 39(1) (2016) 13-27.

35. W. Yang, H. Li, A note on the graphs with given small matching number, Ars Combinatoria 121 (2015) 125-130.

36. W. Yang, H. Li, W. He，Edge-fault-tolerant bipancyclicity of Cayley graphs generated by transposition-generating trees. International Journal of Computer Mathematics 92 (7): 1345-1352 (2015)

37. W. Yang, H. Lin，Reliability Evaluation of BC Networks in Terms of the Extra Vertex- and Edge-Connectivity. IEEE Transaction on Computers 63 (10): 2540-2548 (2014)

38. W. Yang, Y. Tian, H. Li, H. Li, X. Guo，The minimum restricted edge-connected graph and the minimum size of graphs with a given edge-degree. Discrete Applied Mathematics 167: 304-309 (2014).

39. H. Miao, W. Yang，trongly self-centered orientation of complete k-partite graphs. Discrete Applied Mathematics 175: 119-125 (2014)

40. W. Yang, H.-J Lai, H. Li, X. Guo，Collapsible Graphs and Hamiltonicity of Line Graphs. Graphs and Combinatorics 30(2): 501-510(2014)

41. H. Li, W. Yang，Bounding the size of the subgraph induced by mm vertices and extra edge-connectivity of hypercubes， Discrete Applied Mathematics 161 (16-17) (2013) 2753-2757

42. H. Li, W. Yang, A note on collapsible graph and supereulerian graph, Discrete Mathematics 312 (2012) 2223-2227.

43. H. Li, W. Yang, Every 3-connected essentially 10-connected line graph is hamiltonian connected, Discrete Mathematics 312 (2012) 3670-3674.

44. W. Yang, H. Lai, H. Li, X.Guo, Collapsible graphs and hamiltonian connectedness of line graphs, Discrete Applied Mathematics 160 (2012) 1837-1844.

45. W. Yang, L. Xiong, H. Lai, X. Guo, Hamiltonicity of 3-connected line graphs, Applied Mathematics Letters 25 (2012) 1835-1838.

46. Weihua Yang, Jixiang Meng, Generalized Measur of Fault Tolerance in Hypercube Networks, Applied Mathematics Letters 25 (2012) 1335-1339.

47. H. Li, W. Yang, J. Meng, Fault-hamiltonicity of Cayley graphs generated by transposition generating trees, Discrete Mathematics 312 (2012) 3087-3095.

48. H. Lin, W. Yang, J. Shu, Distance spectral radius of digraphs with given connectivity, Discrete Mathematics 312 (2012) 1849–1856.

49. W. Yang, Z. Zhang, C. Qin X. Guo, On super 2-restricted and 3-restricted edge-connected vertex transitive graphs, Discrete Mathematics 311 (2011) 2683-2689. (SCI)

50. W. Yang, Z. Zhang, X. Guo, E. Cheng, L. Lipták, On the edge connectivity of graphs with two orbits of the same size, Discrete Mathematics (2011) 1768-1777. (SCI)

五 学术兼职

中国运筹学会理事、图论组合分会理事（副秘书长）

中国工业与应用数学学会理事、图论组合及应用专业委员会常务理事

山西省工业与应用数学学会副理事长

期刊Journal of Interconnection Networks编委