折叠超立方体的4-限制连通度OA
4-restricted connectivity of folded hypercubes
图G的h-限制连通度κh(G)是一般连通度κ(G)的推广.n-维折叠超立方体FQn是n-维超立方体Qn的一个变种.该文证明了:对n≥7,h=4,折叠超立方体的4-限制连通度是16n-48.最后给出了一个猜想:对h≥0,n≥4,且n≥h+3,FQn的h-限制连通度是2h(n+1-h).
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.
刘景昭
曲阜师范大学学报编辑部,273165,山东省曲阜市
数理科学
限制连通度限制点割折叠超立方体Hamming距离
restricted connectivityrestricted vertex cutfolded hypercubeHamming distance
《曲阜师范大学学报（自然科学版）》 2026 (1)
56-66,11
山东省自然科学基金(ZR2022MA038).
评论