Component connectivity of the hypercubes
Lih‐Hsing Hsu, Eddie Cheng, László Lipták, Jimmy J.M. Tan, Cheng‐Kuan Lin, Tung-Yang Ho
Providence University Oakland University National Yang Ming Chiao Tung University Ta Hwa University of Science and Technology
阅读操作
确认中在文库中上传 PDF 后可生成中文音频讲解。
摘要与影响
The r-component connectivity κ r (G) of the non-complete graph G is the minimum number of vertices whose deletion results in a graph with at least r components. So, κ2 is the usual connectivity. In this paper, we determine the r-component connectivity of the hypercube Q n for r=2, 3, …, n+1, and we classify all the corresponding optimal solutions.
逐年被引趋势
关键指标
同类平均 = 1
同领域 · 同年份 · 同类型
Google Scholar 与 OpenAlex 的被引统计范围不同，数值存在差异属正常。
AI 辅助阅读
依据：摘要
可就本文提问；依据不足时会说明。
学术脉络
学科主题
计算机 / AIInterconnection Networks and Systems
Advanced Graph Theory Research · Complexity and Algorithms in Graphs
参考文献 10
此处列出前 3 条
引用本文 134
按被引量排序，此处列出前 3 条