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.
