Graph theoretic reliability analysis for the Boolean n cube networks

Two graph-theoretic results concerning Boolean n-cube network reliability are presented. First, a simple formula for the number of spanning trees of the Boolean n-cube network is derived. As a result, the reliability function for large failure rate can be readily computed. Second, the Boolean n-cube network is proved to have the super-line-connectivity property. Thus the number of line-disconnecting sets (a set of lines the removal of which results in a disconnected or trivial graph) or order lambda for the Boolean n-cube network is equal to 2/sup n/. >

[1]  Jhing-Fa Wang,et al.  On the number of spanning trees of circulant graphs , 1984 .

[2]  Sartaj Sahni,et al.  Parallel Matrix and Graph Algorithms , 1981, SIAM J. Comput..

[3]  James R. Armstrong,et al.  Fault Diagnosis in a Boolean n Cube Array of Microprocessors , 1981, IEEE Transactions on Computers.

[4]  Sudhakar M. Reddy,et al.  Distributed fault-tolerance for large multiprocessor systems , 1980, ISCA '80.

[5]  Dharma P. Agrawal,et al.  Generalized Hypercube and Hyperbus Structures for a Computer Network , 1984, IEEE Transactions on Computers.

[6]  Ching-Shui Cheng,et al.  Maximizing the total number of spanning trees in a graph: Two related problems in graph theory and optimum design theory , 1981, J. Comb. Theory B.

[7]  Douglas Bauer,et al.  Combinatorial optimization problems in the analysis and design of probabilistic networks , 1985, Networks.

[8]  G. Kirchhoff.  Ueber die Auflösung der Gleichungen, auf welche man bei der Untersuchung der linearen Vertheilung galvanischer Ströme geführt wird , 1847 .

[9]  T. Williams.  The Design of Survivable Communications Networks , 1963 .

[10]  D. R. Shier,et al.  Maximizing the number of spanning trees in a graph with n nodes and m edges , 1974 .

[11]  A. Kelmans,et al.  A certain polynomial of a graph and graphs with an extremal number of trees , 1974 .

[12]  J. Scott Provan,et al.  Calculating bounds on reachability and connectedness in stochastic networks , 1983, Networks.

[13]  Claude E. Shannon,et al.  Reliable Circuits Using Less Reliable Relays , 1956 .

[14]  J. Scott Provan,et al.  The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected , 1983, SIAM J. Comput..