管理员登录
   ·    学位点简介
   ·    研究方向
   ·    招生信息
   ·    教育管理
   ·    答辩公告

学术报告:Uniquely restricted matchings and an extension of G-parking functions

发布时间:2017年06月16日 17:08      访问次数:

报告题目:Uniquely restricted matchings and an extension of G-parking functions

报告人:董峰明(新加坡南洋理工大学)

报告时间:2017年06月21日(周三)下午16:30

报告地点:理学院章辉楼442学术报告厅

联系人:陈海燕教授  

报告摘要:

A matching M in a graph G is said to be uniquely restricted if M is the only perfect matching in the subgraph of G induced by vertices saturated by M. For any connected multigraph G = (V,E) and a fixed vertex v in G, there is a bijection from the set of spanning trees of G to the set of uniquely restricted matchings of size |V|-1 in the bipartite graph S(G)-v , where S(G) is the subdivision of  G. Motivated by this observation, we extend the concept of G-parking functions of graphs to B-parking functions f from X to the set of natural numbers for any bipartite graph H = (X,Y ) and establish a bijection ψ from the set of uniquely restricted matchings in H to the set of B-parking functions of H. If M is a uniquely restricted matching of H of size |X| and f = ψ(M),then for any x X, f(x) is interpreted by the number of some elements y Y which are not saturated by M and are not externally B-active with respect to M in H which is an extension of the concept externally active with respect to a spanning tree T in a connected graph.

报告人简介:

新加坡南洋理工大学副教授,博士生导师,国际著名的色根研究专家。新加坡国立大学博士,曾在新西兰和加拿大从事研究工作。主要研究图多项式,尤其擅长色多项式的研究,近年开始从事拟阵论和纽结研究。现已发表研究论文60多篇,很多发表在组合论国际顶尖刊物JCTB上,出版专著一部(F.M. Dong, K.M. Koh, K.L. Teo, Chromatic polynomials and chromaticity of graphs, World Scientific, Singapore, 2005.)由于在色根的研究方面的出色成果,董教授曾应邀到英国剑桥大学工作访问并作主旨发言。

欢迎广大师生前往听讲!

 

                                    理学院

                                    6月16日

 

版权所有 © 集美大学理学院
地址:厦门市集美区银江路183号(校总部) 邮编:361021