|
个人信息Personal Information
教授 博士生导师 硕士生导师
性别：男
毕业院校：山东大学
学历：博士研究生毕业
学位：理学博士学位
在职信息：在职
所在单位：数学学院
入职时间：2003-03-01
学科：运筹学与控制论
办公地点：山大南路山东大学中心校区知新楼B1054
扫描关注
- [1] Jing, Fei. Quantifying and predicting evolutionary networks. Chaos, Solitons and Fractals, 191, 2025.
- [2] Sun, Lin. On list (p, 1)-total labellings of special planar graphs and 1-planar graphs. Journal of Combinatorial Optimization, 47, 2024.
- [3] 张众. The Generation and Regulation of Public Opinion on Multiplex Social Networks. IEEE TRANSACTIONS ON COMPUTATIONAL SOCIAL SYSTEMS, 1-15, 2024.
- [4] 谭香. THE LINEAR ARBORICITY OF GRAPHS WITH LOW TREEWIDTH. Discussiones Mathematicae Graph Theory, 2024.
- [5] 李亚昆. A Graphical Approach for Robust Set Stabilization of Boolean Control Networks with Lowest Time Complexity. IEEE Transactions on Network Science and Engineering, 2025.
- [6] 杨帆. 4-choosability of planar graphs with 4-cycles far apart via the Combinatorial Nullstellensatz. Discrete Mathematics, 346, 2023.
- [7] 杨帆. <p>The total coloring of K-5-minor-free graphs</p>. European Journal of Combinatorics, 102, 2022.
- [8] 冯洁茹. On generalized neighbor sum distinguishing index of planar graphs. DiscreteMathematicsAlgorithmsandApplications, 14, 2022.
- [9] 荆飞. Toward Structural Controllability and Predictability in Directed Networks. IEEE TRANSACTIONS ON SYSTEMS MAN CYBERNETICS-SYSTEMS, 2022.
- [10] 冯洁茹. The edge colorings of K-5-minor free graphs. Discrete Mathematics, 344, 2021.
- [11] 牛亚伟. Information spreading with relative attributes on signed networks. Information Sciences, 551, 54, 2021.
- [12] 扈琳娜. LIST EDGE COLORING OF PLANAR GRAPHS WITHOUT 6-CYCLES WITH TWO CHORDS. Discussiones Mathematicae Graph Theory, 41, 199, 2021.
- [13] 宋繁鹏. Transcendental behavior and disturbance behavior favor human development. Applied Mathematics and Computation (New York), 378, 2020.
- [14] Sun, Lin. THE LIST EDGE COLORING AND LIST TOTAL COLORING OF PLANAR GRAPHS WITH MAXIMUM DEGREE AT LEAST 7. Discussiones Mathematicae Graph Theory, 40, 1005, 2020.
- [15] Cheng, Xiaohan. Improved bounds for neighbor sum (set) distinguishing choosability of planar graphs. Discrete Mathematics, 343, 2020.
- [16] Liang, Zuosong. List-coloring clique-hypergraphs of K-5-minor-free graphs strongly. Discrete Mathematics, 343, 2020.
- [17] 吴建良 and 王悦. On the (3,1)-choosability of planar graphs without adjacent cycles of length 5, 6, 7. Discrete Mathematics, 342, 1782, 2019.
- [18] 吴建良 and 王悦. On the (3,1)-choosability of planar graphs without adjacent cycles of length 5, 6, 7. Discrete Mathematics, 342, 1782, 2019.
- [19] 孙林 and 吴建良. ON EDGE COLORINGS OF 1-PLANAR GRAPHS WITHOUT 5-CYCLES WITH TWO CHORDS. Discussiones Mathematicae Graph Theory, 39, 301, 2019.
- [20] 王光辉 , 吴建良 and 胡杰. Adjacent vertex distinguishing total coloring of planar graphs with maximum degree 9. Discrete Mathematics, 342, 1392, 2019.