题  目：Network design with desired strength and given valence conditions

内容简介：Given processors $v_1,v_2, …, v_n$ each of which has valance $d_1, d_2, …, d_n$, and a network strength level or reliability level, is it possible to design a network to connect these processors with the given valances such that the resulting network will have the expected strength level  or the expected  reliability level? The problem is modeled as a graphic sequence realization problem in graph theory. We will present some of the recent progresses in this problem when the strength level or reliability level are measured by the maximum number of edge disjoint spanning trees in graphs, the fractional arboricity and the strength of graphs, the restricted connectivity of graphs and the strong connectivity of digraphs.

报告人：美国西弗吉尼亚大学（West Virginia University）Hong-Jian Lai  教授

报告人简介：美国西弗吉尼亚大学数学系教授，副系主任。主要研究领域为图论。曾任Discrete Mathematics杂志客座编委，现任Graph and Combinatorics以及Journal of Discrete Mathematics等杂志编委。已出版专著三部，发表学术论文180余篇。

时  间：2017年12月12日（周二）上午10：30始

地  点：三楼西数学系会议室

热烈欢迎广大师生参加!

信息科学技术学院/网络空间安全学院

2017年12月11日