报告题目【A cell construction scheme for cubic fault tolerant 1p-Hamiltonian graphs】
时间：2019年3月24日 (星期日) 14:00
地点：旗山校区理工北楼601报告厅
主讲：台湾交通大学教授，徐力行
主办：福建省网络安全与密码技术重点实验室
参加对象：福建省网络安全与密码技术重点实验室、数信学院相关教师和研究生
专家简介：Lih-Hsing Hsu received his BS in mathematics from Chung Yuan Christian University, Taiwan, Republic of China, in 1975, and his PhD in mathematics from the State University of New York at Stony Brook in 1981 to 1985, he was an associate professor at the Department of Applied Mathematics at National Chiao Tung University in Taiwan. From 1985 to 1988, he was the chairman of the Department of Applied Mathematics at National Chiao Tung University. After 1988, he joined the Department of Computer and Information Science of National Chiao Tung University. In 2004, he retired from National Chiao Tung University, holding a title as an honorary scholar of that university. His research interests include interconnection networks, algorithms, graph theory, and VLSI layout.
报告摘要：A graph G = (V,E) is Hamiltonian if there exists a spanning cycle in G. A Hamiltonian graph G = (V,E) is 1-edge fault tolerant Hamiltonian if G－F remains Hamiltonian for any fault F that is an edge in E. A bipartite Hamiltonian graph G = ( B∪W , E) is 1p-fault tolerant Hamiltonian if G－F remains Hamiltonian for any fault F that is consisted of a vertex in B and a vertex in W.
In this talk, we introduce a construction scheme for cubic bipartite graphs that is 1-edge fault tolerant Hamiltonian and 1p-fault tolerant Hamiltonian.
