題  目：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始

地  點：三樓西數學系會議室

熱烈歡迎廣大師生參加!

太阳集团1088vip/網絡空間安全學院

2017年12月11日