Then it is proved that the smallest vertex degree, vertex connectivity and link connectivity are all n, which is holding the best connectivity the same as the hypercube and the crossed cube.

  • 然后证明了n维HCH-立方体互连网络的最小顶点度数和顶点连通度和边连通度为n,保持了超立方体和交叉立方体的最高连通度的优点;

  • 互联网摘选 2025-01-20 11:38:26

    • 相关例句
    精确
    • 模糊
    • 词首
    • 词尾
    • 词义
    • 例句