报告人：林政宽副教授

              苏州大学

报告题目：On the spanning connectivity and spanning laecability of graphs

报告时间：2017年12月22日下午16:30

报告地点：海韵行政楼B313

摘要：A Hamiltonian path is a path in a graph that visits each vertex exactly once. A Hamiltonian cycle is a Hamiltonian path that is a cycle. Determining whether such paths and cycles exist in graphs is the Hamiltonian path problem, which is NP-complete.There are many variants of hamiltonian problems such as fault-tolerance hamiltonian, pancyclic, panconnceted, k-ordered hamiltonian, spanning connectivity, etc. In this talk, we focus on the problem of spanning connectivity and spanning laecability. A k-container C(u, v) of a graph G is a set of k disjoint paths between u and v. A k-container C(u, v) of G is a k∗-container if it contains all vertices of G. A graph G is k∗-connected if there exists a k∗-container between any two distinct vertices of G. Therefore, a graph is 1∗-connected (respectively, 2∗-connected) if and only if it is Hamiltonian connected (respectively, Hamiltonian). A graph G is super spanning connected if there exists a k∗-container between any two distinct vertices of G for every k with 1 ≤ k ≤ κ(G) where κ(G) is the connectivity of G. A bipartite graph G is k∗-laceable if there exists a k∗-container between any two vertices from different partite set of G. A bipartite graph G is super spanning laceable if there exists a k∗-container between any two vertices from different partite set of G for every k with 1 ≤ k ≤ κ(G). We will discuss the properties on spanning connectivity and spanning laecability of graphs.

报告人简介： 林政宽，男，苏州大学计算机科学与技术学院特聘副教授，硕士生导师。2011年获交通大学(台湾)资讯学院资讯科学与工程系工学博士学位。研究方向：图论应用，并行计算系统、交换网络、无线网络、无线传感器网络、算法设计与分析、大数据等。IEEE TC、IEEE TPDS、Theoretical Computer Science、Information Sciences、Discrete Mathematics等期刊审稿人。ICCSN 2017、ICEIT 2016、AEST 2016、CCNC 2016、APNOMS 2014、ICPP 2012学术会议的程序委员会委员。在国内外学术期刊和国际学术会议上发表(含录用)论文逾90篇，其中IEEE TC、IEEE TPDS、IEEE TR、Theoretical Computer Science等SCI收录逾40篇。并于交换网络与无线网络的研究领域上发行了两本专著。

联系人：钱建国教授

欢迎广大师生参加！