曲阜师范大学学报（自然科学版）2026，Vol.52Issue(1)：56-66,11.DOI:10.3969/j.issn.1001-5337.202509.065
折叠超立方体的4-限制连通度
4-restricted connectivity of folded hypercubes
摘要
Abstract
The h-restricted connectivity κh(G)of graph G is a promotion of traditional connectivity κ(G).n-dimensional folded hypercube FQn is a variant of hypercube Qn.In this paper,it is proved that the 4-restricted connectivity of an n-dimensional folded hypercube is 16n-48 for n≥7.In the end,a conjecture is proposed:κh(FQn)=2h(n+1-h)for h≥0,n≥4,and n≥h+3.关键词
限制连通度/限制点割/折叠超立方体/Hamming距离Key words
restricted connectivity/restricted vertex cut/folded hypercube/Hamming distance分类
数理科学引用本文复制引用
刘景昭..折叠超立方体的4-限制连通度[J].曲阜师范大学学报（自然科学版）,2026,52(1):56-66,11.基金项目
山东省自然科学基金(ZR2022MA038). （ZR2022MA038）
