Jianliang Wu
Professor
本人现为山东大学教授、博士生导师。正式发表学术的论文有180余篇，连续主持和参与了国家级自然科学基金多项，参与并完成国家自然科学基金重点项目2项。主要研究方向:图理论及其算法, 复杂网络,知识图谱，图神经网络.图理论方面主要研究的是图的染色. Mathematical Reviews Web of Science More+
Paper Publications
-
[61] Jianliang Wu and Qi, Xingqin. Eb&D: A new clustering approach for signed social networks based on both edge-betweenness central.... PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS, 482, 14, 2017.
-
[62] Guanghui Wang , Jianliang Wu and 成晓晗. The adjacent vertex distinguishing total chromatic numbers of planar graphs with Delta=10. Journal of Combinatorial Optimization, 34, 383, 2017.
-
[63] Guanghui Wang , Jianliang Wu and 陈冠涛. Equitable vertex arboricity of 5-degenerate graphs. Journal of Combinatorial Optimization, 34, 426, 2017.
-
[64] Jianliang Wu and 胡代强. Planar graphs without intersecting 5-cycles are 4-choosable. Discrete Mathematics, 340, 1788, 2017.
-
[65] Jianliang Wu and 胡代强. Planar graphs without intersecting 5-cycles are 4-choosable. Discrete Mathematics, 340, 1788, 2017.
-
[66] Guanghui Wang , Jianliang Wu and 成晓晗. The adjacent vertex distinguishing total chromatic numbers of planar graphs with Delta=10. Journal of Combinatorial Optimization, 34, 383, 2017.
-
[67] Guanghui Wang , Jianliang Wu and 陈冠涛. Equitable vertex arboricity of 5-degenerate graphs. Journal of Combinatorial Optimization, 34, 426, 2017.
-
[68] Jianliang Wu and 孙林. The Wiener Index of r-Uniform Hypergraphs. Bulletin of the Malaysian Mathematical Sciences Society, 40, 1093, 2017.
-
[69] Jianliang Wu and 胡代强. On the Equitable Edge-Coloring of 1-Planar Graphs and Planar Graphs. Graphs and Combinatorics, 33, 945, 2017.
-
[70] Guanghui Wang , Jianliang Wu and 丁来浩. Neighbor Sum (Set) Distinguishing Total Choosability Via the Combinatorial Nullstellensatz. Graphs and Combinatorics, 33, 885, 2017.
-
[71] Jianliang Wu and 孙林. On total colorings of some special 1-planar graphs. ACTA MATHEMATICAE APPLICATAE SINICA-ENGLISH SERIES, 33, 607, 2017.
-
[72] Jianliang Wu and 胡代强. On the Equitable Edge-Coloring of 1-Planar Graphs and Planar Graphs. Graphs and Combinatorics, 33, 945, 2017.
-
[73] Jianliang Wu and 孙林. The Wiener Index of r-Uniform Hypergraphs. Bulletin of the Malaysian Mathematical Sciences Society, 40, 1093, 2017.
-
[74] Jianliang Wu and 孙林. On total colorings of some special 1-planar graphs. ACTA MATHEMATICAE APPLICATAE SINICA-ENGLISH SERIES, 33, 607, 2017.
-
[75] Guanghui Wang , Jianliang Wu and 丁来浩. Neighbor Sum (Set) Distinguishing Total Choosability Via the Combinatorial Nullstellensatz. Graphs and Combinatorics, 33, 885, 2017.
-
[76] Jianliang Wu and 许仁誉. A sufficient condition for a planar graph to be 4-choosable. Discrete Applied Mathematics, 224, 120, 2017.
-
[77] Jianliang Wu and 许仁誉. A sufficient condition for a planar graph to be 4-choosable. Discrete Applied Mathematics, 224, 120, 2017.
-
[78] Jianliang Wu and 付京成. Identification of leader and self-organizing communities in complex networks. Scientific Reports, 7, 2017.
-
[79] Jianliang Wu and 付京成. Identification of leader and self-organizing communities in complex networks. scientific reports, 7, 2017.
-
[80] Reinterpretaion of the friendship paradox. International Journal of Modern Physics C, 28, 2017.