图与组合系列讲座之四十二(冯荣权教授)

发布时间:2019-04-18作者:访问量:58

报告题目:A Characterization of Iterated Line Graphs

报 告 人:冯荣权教授(北京大学)

报告时间:2019420号(周六)下午15:00-16:00

报告地点:磬苑校区数学科学学院H306

报告摘要:Let X be a graph with edge set E(X). The line graph L(X) of X is the graph with vertex set E(X) and two vertices are adjacent in L(X) if and only if the corresponding edges share precisely one common vertex in X. The n-th iterated line graph Ln(X) of X is defined recursively by L1(X) = L(X) and Ln(X) = L(Ln1(X)) for n > 1. In this talk, normal walks of norm s, which is a generalization of s-arcs in a graph, are defined and their additive properties are studied. As a result, a characterization of iterated line graphs is given in terms of normal walk graphs constructed by normal walks.

欢迎各位老师、同学届时前往!

  

科学技术处

2019418


返回原图
/