A Class of Hypergraphs with the Best Connectivity
CSTR:
Clc Number:

O157.5 TP303

  • Article
  • | |
  • Metrics
  • |
  • Reference
  • |
  • Related
  • |
  • Cited by
  • | |
  • Comments
    Abstract:

    A jumping sequence is proposed,so that a class of r-uniform hypergraphs with nvenices and n edges is constructed. Then by analysing the connectivity of its two-section (graph),this class of hypergraphs is proved to have the best connectivity. The class of hypergraphs can beused to desisn the optimal fault-tolerant multibus computer systems.

    Reference
    Related
    Cited by
Get Citation

何中市 陈廷槐.一类具有最佳连通性的超图[J].重庆大学学报,1996,19(6):33~38

Copy
Share
Article Metrics
  • Abstract:
  • PDF:
  • HTML:
  • Cited by:
History
Article QR Code