王光辉1979年11月生；副教授，博士生导师。

学术经历2009—，山东大学数学学院，副教授2012.2—2012.8，微软研究院，访问学者（青年教师铸星计划）2008.3—2009.9，法国中央理工学院应用数学实验室，博士后学习经历2005.11—2007.7，法国巴黎南大学信息科学实验室，博士学位2001.9—2005.10，山东大学数学学院，硕博连读1997.9—2001.7，山东大大学数学学院，学士学位项目2015—2018，图与超图的极值问题，山东省杰出青年基金，负责人2015—2018，图的匹配和染色，国家自然科学基金（面上基金），负责人2012—2014，图的子图和染色，国家自然科学基金（青年基金），负责人2012—2014，图与网络的结构研究，山东省优秀中青年奖励基金， 负责人2011—2012，图的彩色子图，国家自然科学基金（数学天元基金），负责人2011—2013，边染色图的结构和性质，教育部高校博士点专项基金，负责人2010—2011，图的结构和染色及其应用，山东大学自主创新基金（人才引进），负责人2010—2011，边染色图中的子图，教育部留学回国人员科研启动基金，负责人论文(with T. Wang and G. Liu) Long properly colored cycles in edge colored complete graphs, Discrete Mathematics, Volume 324, 56–61, 2014. (SCI)(with G. Yan) An improved upper bound on edge weighted choosability of graphs, Graph and Combinatorics, 10.1007/s00373-014-1479-0. (SCI)(with Z. Chen and J. Wang) Neighbor sum distinguishing index of planar graphs, Discrete Mathematics, Volume 334,70-73,2014. (SCI)(with G. Yan), An improved upper bound for neighbor sum distinguishing index of graphs, Discrete Applied Mathematics, Volume 175,126-128, 2014. (SCI)(with L. Ding and G. Yan) Neighbor sum distinguishing total coloring via the Combinatorial Nullstellensatz, Science China Mathematics, Volume 57, Issue 9, 1875-1882, 2014. (SCI)(with A. Dong) Neighbor Sum Distinguishing Total Colorings of Graphs with Bounded Maximum Average Degree, ActaMathematicaSinica, English Series, Volume 30, Issue 4,70-79, 2014. (SCI)(with S. Gao et al.) Ranking the spreading ability of nodes in complex networks based on local structure, Physica A: Statistical Mechanics and its Applications, http://dx.doi.org/10.1016/j.physa.2014.02.032, 2014. (SCI)(with J. Fu, J. Wu and J. Xu) A note on edge weight choosability of graphs, Discrete Mathematics, Algorithms and Applications, DOI: 10.1142/S**00104, 2014.(with A. Dong and J. Zhang) Neighbor sum distinguishing edge colorings of graphs with bounded maximum average degree, Discrete Applied Mathematics, Volume 166,84–90, 2014. (SCI)(with G. Yan) Edge coloring by total labelings of outerplanar graphs, Acta Mathematica Sinica, English Series, Volume 29, Issue 11, 2129–2136, 2013. (SCI)(with H. Li, L. Ding and B. Liu) Neighbor sum distinguishing total colorings of planar graphs, Journal of Combinatorial Optimization, DOI 10.1007/s10878-013-9660-6, 2013. (SCI)(with B. Liu and G. Liu) A note on rainbow matchings, Discrete Mathematics, Algorithms and Applications, Volume 5, Issue 4,**, 2013.(with H. Li and B. Liu) Neighbor sum distinguishing total colorings of K4-minor free graphs, Frontiers of Mathematics in China, Volume 8, Issue 6, 1351-1366, 2013. (SCI)(with G. Yan, J. Yu and X. Zhang) The r-acyclic chromatic number of planar graphs, Journal of Combinatorial Optimization, 2013, DOI 10.1007/s10878-013-9619-7. (SCI)(with J. Zhang and G. Liu) Existence of rainbow matchings in properly edge-colored graphs,Frontiers of mathematics in China, 7(3)(2012),543-550. (SCI)(with A. Dong) Neighbor sum distinguishing coloring of some graphs, Discrete Mathematics Algorithms and Applications, 4(4)(2012),**.(with X. Zhang et al.) On r-acyclic edge colorings of planar graphs, Discrete Applied Mathemaitcs,160(13-14)(2012),2048-2053. (SCI)(With J. Cai and G. Yan) Planar graphs with maximum degree 8 and without intersecting chordal 4-cycles are 9-totally colorable, Science China Mathematics,55(12)(2012),2601-2612. (SCI)(with H. Li, Y. Zhu and G. Liu) A note on heterochromatic C4 in edge-colored triangle-free graphs, Graph and Combinatorics, 28(6)(2012), 901-905. (SCI)(with H. Li) Color degree and Heterechromatic cycles in edge-colored graphs, European J. Comb. 33 (8)(2012), 1958-1964. (SCI)(with B. Liu, G. Yu and G. Liu) Circular colorings of digraphs, Graph and Combinatorics, 28(6)(2012), 889-900. (SCI)(with J. Yu and N. Wang) Constructing minimum extended weakly-connected dominating sets for clustering in ad hoc networks, J. Parallel Distrib. Comput.,72(1)(2012),35-47. (SCI)(with J. Yu, Y. Qi and X. Gu) A cluster-based routing protocol for wireless sensor networks with nonuniform node distribution, Internal Journal of Electronics and Communications (AEU), 66(1)(2012),54-61. (SCI)(with G. Liu) Circular choosability of planar graphs with large girth, Ars Combinatoria 99(2011), 65-73. (SCI)(with J. Yu and Y. Qi) An energy-driven unequal clustering protocol for heterogeneous wireless sensor networks, Journal of Control Theory Appl., 9 (1)(2011),133-139.(with J. Hou and G. Liu) Improved bounds for acyclic chromatic index of planar graphs, Discrete Mathematics, 159 (2011), 876-881. (SCI)Rainbow matchings in properly edge-colored graphs, Electronic Journal of Combinatorics, 18 (2011), #R162. (SCI)(with S. Zhou, J. Wu and G. Liu) Circular vertex arboricity. Discrete Applied Mathematics 159(12): 1231-1238 (2011) (SCI)(with S. Zhou and H. Li) The k-dominating cycles in graphs. Eur. J. Comb. 31(2): 608-616 (2010) (SCI)(with S. Zhou and H. Li) Algorithm for two disjoint long paths in 2-connected graphs. Theor. Comput. Sci. 411(34-36)(2010), 3247-3254. (SCI)(with J. Yu and N. Wang) Heuristic Algorithms for Constructing Connected Dominating Sets with Minimum Size and Bounded Diameter in Wireless Networks. WASA (2010),11-20.(with Z. Fang et al. ) Differential gene response to oxygen availability in Kluyveromyces lactis: an insight on the evolution of oxygen responding systems from an ancestral ‘pre-WGD’ genome to a ‘post-WDG’ genome in yeast, Public library of science one, 10(4)(2009):e7531 (SCI)(with H. Li) Color degree and alternating cycles in edge-colored graphs. Discrete Mathematics 309(13)(2009), 4349-4354. (SCI)(with G. Liu) Paths, cycles and circular colorings in digraphs. Theor. Comput. Sci. 410(21-23)(2009),1982-1985. (SCI)(with H. Li, X. Li and G. Liu) The heterochromatic matchings in edge-colored bipartite graph, Ars combinatorica, 93(2009), 129-139. (SCI)(with J. Yu and S. Cui)Approximating the Multicast Traffic Grooming Problem in Unidirectional SONET/WDM Rings. COCOA (2009), LNCS 5573(2009),519-529.(with J. Yu and S. Cui) An Algorithm with Better Approximation Ratio for Multicast Traffic in Unidirectional SONET/WDM Rings. COCOA 2009, LNCS 5573(2009), 530-540.(with H. Li) Heterochromatic matchings in edge-colored graphs. Electron. J. Combin. 15 (2008), #R138. (SCI)(with H. Li) Color degree and heterochromatic matchings in edge-colored bipartite graphs, Utilitas Mathematica, 77(2008), 145-154. (SCI)(with T. Kaiser, R. Kuzel and H. Li) A Note on k -walks in Bridgeless Graphs. Graphs and Combinatorics 23(3)(2007),303-308. (SCI)(with H. Li and S. Zhou) Long Alternating Cycles in Edge-Colored Complete Graphs. Lecture Notes in Computer Science 2007,305-309.(with G. Liu and J. Yu) Circular list colorings of some graphs, J. Appl. Math. Computing, 20(1-2)(2006), 149-156.在读硕士研究生已毕业研究生：李华龙（曾获得国家奖学金、山东大学五四青年科学奖）。在读研究生：丁来浩（硕博连读），曲存全（硕博连读），于筱蔚（硕博连读），李瞳。