学术讲座【ancyclic two-disjoint-cycle covers of graphs】
时间：2019年11月23日 (星期六) 14:00 ~ 16:00
地点：旗山校区理工北楼601报告厅
主讲：Asia University associate professor，Tzu-Liang Kung
主办：福建省分析数学及应用重点实验室, 数学研究中心
参加对象：数信学院相关教师与研究生
报告人简介：Tzu-Liang Kung received the BS degree in industrial administration from Taiwan University in 1997, the MS degree in statistics from Taiwan Chiao Tung University, Taiwan, in 2001, and the PhD degree in computer science from Taiwan Chiao Tung University in 2009. From 2001 to 2004, he served as a Senior Engineer at the Behavior Design Corporation, Taiwan. He is currently an associate professor in the Department of Computer Science and Information Engineering, Asia University, Taiwan. His research interests include multivariate data analysis, machine translation, natural language processing, interconnected systems, fault-tolerant computing, and algorithm design.
报告摘要：：A graph G = (V, E) is two-disjoint-cycle-cover [r1, r2]-pancyclic if for any integer l satisfying r1 ≤ l ≤ r2, there exist two vertex-disjoint cycles C1 and C2 in G such that the lengths of C1 and C2 are l and |V (G)|−l, respectively, where |V (G)| denotes the total number of vertices in G. On the basis of this definition, we established both Dirac-type and Ore-type conditions for graphs to be two-disjoint-cycle-cover vertex/edge [r1, r2]-pancyclic. In addition, we also study the cycle embedding in crossed cubes and locally twisted cubes under the consideration of two-disjoint-cycle-cover vertex/edge pancyclicity.
