报告题目：Cyclic connectivity of Cayley graphs generated by unicyclic triangle-free graphs
时 间：2026年07月03日 (星期五) 15：00
地 点：科研楼18号楼1102
主 办：数学与统计学院、分析数学及应用教育部重点实验室、福建省分析数学及应用重点实验室、福建省应用数学中心（福建师范大学）
参加对象：感兴趣的老师和研究生
报告摘要：Connectivity serves as a fundamental metric for evaluating the reliability and fault tolerance of interconnection networks. To more precisely characterize network robustness, the concept of cyclic connectivity has been introduced, requiring that there are at least two components containing cycles after removing the faulty vertex set. This property ensures the preservation of essential cyclic communication structures under faulty conditions. Cayley graphs exhibit several ideal properties for interconnection networks, which permit identical routing protocols at all vertices, facilitate recursive constructions, and ensure operational robustness. In this paper, we investigate the cyclic connectivity of Cayley graphs generated by unicyclic triangle-free graphs. Given an symmetric group Sn on {1, 2, . . . , n} and a set T of transpositions of Sn. Let G(T ) be a graph on vertex set {1, 2, . . . , n} and edge set {ij : (ij) ∈ T }. If G(T) is a unicyclic triangle-free graph, then the Cayley graph Cay(Sn, T ) is denoted by UGn. As a result, we determine the exact value of cyclic connectivity of UGn as κc(UGn) = 4n − 8 for n ≥ 4.
报告人简介：张肇明教授是台北商业大学特聘教授，于2001年台湾中央大学取得博士学位。于2011至2014年担任台北商业大学资讯与决策科学研究所所长，2014 至2015年担任台北商业大学管理学院院长。目前兼任演算法与计算理论学会理事一职。已经连续24年（共15次）获得台湾科技专题研究项目主持人。学术研究上，共发表约150余篇SCI期刊论文与 50余篇国际会议论文。目前，主要的研究领域包括算法设计与分析，图论，并行与分布式计算，网络分析与优化等主题。