报告题目:Supereulerian line graphs
报告人:熊黎明教授,北京理工大学
报告时间:2021年10月19日上午10:00-11:00
报告地点:腾讯会议(会议号:792529575)
主持人:何伟骅
报告摘要:Supereulerian graph is the graph that has a Eulerian spanning subgraph, while the line graph L(G) is the graph with E(G) as its vertex set in which each pair of e, f in E(G) are adjacent if they have a common vertex in G. There is a well characterization of a graph G with Hamiltonian line graph, given by Harary and Nash-Walliam, while there are at least two types of characterization of G with supereulerian line graphs. In this talk we shall show some recent results on supereulerian line graph by using edge-degree condition and so on.
专家简介:熊黎明,北京理工大学教授、博导。2001年于荷兰特文特大学获得博士学位。现任中国运筹学会图论组合分会理事,Open Journal of Discrete Mathematics,ISRN Biotechnology,《运筹与模糊学》(Operations Research and Fuzziology)等杂志编委。先后在比利时、荷兰、德国、捷克、日本、中国台湾、斯洛伐克、美国的大学或研究所作学术访问。主持完成两项国家自然科学基金面上项目和一项教育部留学回国基金项目。发表或接收学术论文80余篇。研究领域为图论,包括图的结构理论,哈密尔顿圈与因子存在性及极值问题,哈密尔顿指数,线图,无爪图及其它禁用子图,算法复杂性,拓扑指标以及矩阵迹理论等。